KVS 22-12-2018 Part-A
October 23, 2023Research-Aptitude
October 23, 2023Algorithms
| Question 48 |
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is:
| 2h-1 | |
| 2h-1 + 1 | |
| 2h – 1 | |
| 2h |
Question 48 Explanation:
Let’s take an example,
Above tree satisfies the property given in the question. Hence, only option (B) satisfies it.
Above tree satisfies the property given in the question. Hence, only option (B) satisfies it.
Correct Answer: B
Question 48 Explanation:
Let’s take an example,
Above tree satisfies the property given in the question. Hence, only option (B) satisfies it.
Above tree satisfies the property given in the question. Hence, only option (B) satisfies it.