Software-Engineering
November 15, 2023Data-Structures
November 15, 2023Data-Structures
| Question 42 |
Which of the following statements is false?
| A tree with a n nodes has (n – 1) edges | |
| A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results | |
| A complete binary tree with n internal nodes has (n + 1) leaves | |
| Both B and C |
Question 42 Explanation:
A: Tree with n nodes must have (n-1) edges.
D: The maximum no. of nodes in a binary tree of height h is 2h+1 – 1.
h=2 ⇒ 23 – 1 ⇒ 7
D: The maximum no. of nodes in a binary tree of height h is 2h+1 – 1.
h=2 ⇒ 23 – 1 ⇒ 7
Correct Answer: D
Question 42 Explanation:
A: Tree with n nodes must have (n-1) edges.
D: The maximum no. of nodes in a binary tree of height h is 2h+1 – 1.
h=2 ⇒ 23 – 1 ⇒ 7
D: The maximum no. of nodes in a binary tree of height h is 2h+1 – 1.
h=2 ⇒ 23 – 1 ⇒ 7