For this question, a complete binary tree has either zero or two children at…
GATE · Computer Science · 1998
For this question, a complete binary tree has either zero or two children at every node. Which of the following statements is false?
- A.
A tree with n nodes has (n−1) edges
- B.
A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results.
- C.
A complete binary tree with n internal nodes has (n+1) leaves.
- D.
The maximum number of nodes in a binary tree of height h is 2(h+1) − 1
Attempted by 293 students.
Show answer
Correct answer: B
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…