In a complete k-ary tree, every internal node(n) has exactly k children or no…
In a complete k-ary tree, every internal node(n) has exactly k children or no child. The number of leaves in such a tree with an internal node is:
- A.
n.k
- B.
(n – 1) k+ 1
- C.
n (k – 1) + 1
- D.
n (k – 1)
Attempted by 272 students.
Sign up free to check your answer
Sign up freeLoading lesson…