GATE | CS | 2007 | Data Structures | Trees | Question 43

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?

3

4

5

6

This question is part of this quiz :

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