Data Structures | Binary Trees | Question 10

Last Updated :
Discuss
Comments
A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, what is the value of n?
6
3
4
5

This question is part of this quiz :

Top MCQs on Binary Trees Data Structure with Answers,JavaScript Trees
Tags:
DSA Quiz
JavaScript
Web Technologies
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy