GATE | CS | 2005 | Data structures | Trees | Question 36

Last Updated :
Discuss
Comments

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)

This question is part of this quiz :

GATE-CS-2005,Trees GATE CS PYQ Quiz
Tags:
GATE
Data Structures
GATE CS
Share your thoughts in the comments