GATE 2005
March 12, 2025GATE 2005
March 12, 2025GATE 2005
| Question 36 |
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:
| nk | |
| (n – 1) k + 1 | |
| n (k – 1) + 1 | |
| n (k – 1) |
Question 36 Explanation:
Total nodes = nk+1 (1 for root)
Leaves = total nodes – internal nodes
= nk+1-n
= n(k-1)+1
Leaves = total nodes – internal nodes
= nk+1-n
= n(k-1)+1
Correct Answer: C
Question 36 Explanation:
Total nodes = nk+1 (1 for root)
Leaves = total nodes – internal nodes
= nk+1-n
= n(k-1)+1
Leaves = total nodes – internal nodes
= nk+1-n
= n(k-1)+1