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 _____
View answer
4
Practice Problem
The postorder traversal of a binary tree is 11,12,10,16,19,18,20,15. The inorder traversal of the same tree is 10, 11, 12, 15, 16, 18, 19, 20. 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 _