Question 10966 – Halstead-method
November 15, 2023Question 9997 – Data-Structures
November 15, 2023Question 9974 – Data-Structures
Which of the following statements is false?
Correct Answer: D
Question 21 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
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
Subscribe
Login
0 Comments