-
In a complete k-array 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)
- nk
Correct Option: C
No. of internal nodes = n Each node has k children
So total nk
Leaf nodes = nk – n
= n(k – 1)
So considering not node also.
No. of leaf nodes = n(k – 1) + 1
Hence (c) is correct option.
