Question 25 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? Not yet answered Marked out of 200 Flag question Select one: O A. It has only one child or only left subtree and its right subtree is empty. B. it is a Max-Heap C. it a Min-Heap D. its hight is 3 Question 26 The inorder Traversal of the following tree is Answer saved