GATE Computer Science (CS) 2018 Shift 1 Solved Paper

Question : 25 of 65

Marks: +1, -0

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 longest path from the root to any leaf. The height of the binary tree above is ──────.

Solution:

Given, post-order

-8,9,6,7,4,5,2,3,1

and in-order

-8,6,9,4,7,2,5,1,3

So the height of tree is 4 .

Go to Question:

Prev Question

Next Question