A) Binary tree that is essentially complete and a min heap; Enter the file name for the edges of the tree: edge.txt Enter number of nodes: 10 Enter the file name for the data of the nodes: data.txt The binary tree is essentially complete and a Min-heap!! B) Binary tree that is essentially complete, but not a min heap; Enter the file name for the edges of the tree: edge.txt Enter number of nodes: 11 Enter the file name for the data of the nodes: data.txt The binary tree is essentially complete, but not a min heap C) Binary tree that is not essentially complete (in this case, we need not check for the min heap property). Enter the file name for the edges of the tree: edge.txt Enter number of nodes: 5 Enter the file name for the data of the nodes: data.txt The binary tree is not essentially complete; hence it is not a min heap