Suppose that the last node in the inorder traversal of some nonempty binary tree is the same as the last node in the postorder traversal. What can you conclude about the tree? Select one: O A. It has only one child or only left subtree and its right subtree is empty. O B. it is a Max-Heap O C. it a Min-Heap O D. its hight is 3