COCOMO-Model
October 3, 2023DFA
October 3, 2023GATE 2007
|
Question 12
|
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:
|
2h−1
|
|
|
2h−1 – 1
|
|
|
2h+1– 1
|
|
|
2h+1
|
Question 12 Explanation:
img src = “https://solutionsadda.in/wp-content/uploads/2020/01/f3-4.jpg”>
1, 3, 7, 15, 31, … = 2h+1 – 1
1, 3, 7, 15, 31, … = 2h+1 – 1
Correct Answer: C
Question 12 Explanation:
img src = “https://solutionsadda.in/wp-content/uploads/2020/01/f3-4.jpg”>
1, 3, 7, 15, 31, … = 2h+1 – 1
1, 3, 7, 15, 31, … = 2h+1 – 1
Subscribe
Login
0 Comments