![The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree](https://www.gkseries.com/blog/wp-content/uploads/2023/09/The-postorder-traversal-of-a-binary-tree-is-896745231.-The-inorder-traversal-of-the-same-tree.jpg)
Q. The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is .
Ans: 4
Sol:
Given, post-order – 8, 9, 6, 7, 4, 5, 2, 3, 1
and in-order – 8, 6, 9, 4, 7, 2, 5, 1, 3