GATE 2018 Previous Year Paper Solution Question 20 :- Computer Science

This video includes question which was asked in the exam of GATE 2018.

Question :- 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 binary tree above is _________ .

The solution is given in the video.