- Courses
- Tutorials
- Interview Prep
Data Structures | Binary Trees | Question 15
Last Updated :
Discuss
Comments
In a complete k-ary tree, every internal node has exactly k children or no child. 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 :
Top MCQs on Binary Trees Data Structure with Answers,JavaScript TreesShare your thoughts in the comments
GeeksforGeeks