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 _______. A 1 b 2 3 4
Answers
Answered by
0
Answer:
syjkubfdmb
g
nj a new ng xx hu sahil ku a big ktys
Similar questions