Question: Question 21 Suppose that the last node in the inorder traversal of some nonempty binary tree is the same as the last node in the

Question 21 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 2.00 Select one: P Flag question 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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
