Concept drill
internal nodes
GATE CSE & IT · Data Structures · 1998-2007
4
PYQs
100%
keyed
0
elite explanations
4
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2007 PYQ
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...
easyanswer key
2005 PYQ
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
easyanswer key
2002 PYQ
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:
easyanswer key
1998 PYQ
A complete n-ary tree is one in which every node has O or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves in it is given by
easyanswer key