Applied Course | Mock GATE | Test 1 | Question: 43

Question

The postorder traversal of a binary search tree is $25, 33, 30, 35, 42, 48, 40, 60, 58, 50$. The inorder traversal of the same tree is $25, 30, 33, 35, 40, 42, 48, 50, 58, 60$. What is the length of the longest path from one leaf to another leaf. (Note: Length of longest path means total number of nodes present in that path).

Answer 1

After constructing binary search from postorder and inorder is

Total number of nodes $= 7$.

Comments

why not 25-33? 9 nodes in the path

---

it should have been mentioned in the question that we need to count source vertex also :/

---

exactly