January 12, 2019 | GATE Computer Science CSE/IT Lectures in Hindi | Leave a comment Views:0|Rating:0.00|View Time:3:36Minutes|Likes:0|Dislikes:0This 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.