Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Tree Complete Binary Tree
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 ?
1
3
2
4
3
5
4
6