Which of the following statement 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).
Answer: (B) (C)
Explanation: Both option (A) and (D) are correct. But option (B) is false because “a labeled rooted binary tree can not be uniquely constructed given using its postorder and preorder traversal results”. It need inorder and preorder/postorder for uniquely constructed binary tree.
Option (C) is also false, take counter example in given tree :
Therefore, both option (B) and (C) are false.
Quiz of this Question