In a complete k-ary tree, every internal node has exactly k children. The…
GATE · 2005 · CS
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
- A.
nk
- B.
(n - 1)k + 1
- C.
n(k - 1) + 1
- D.
n(k - 1)
Attempted by 607 students.
Sign up free to check your answer
Sign up freeLoading lesson…