Question 12149 – Problem-Solving
May 7, 2024Question 8900 – Compiler-Design
May 7, 2024Question 13923 – Data-Structures
A complete n-ary tree is a tree in which nodes have 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?
Correct Answer: C
Question 659 Explanation:
L =(n-1)I+1 where L= no. of leaf nodes, I= Internal Node
41 = (n-1)10+1
41 = 10n – 10+1
10n= 41-1+10
N = 5
41 = (n-1)10+1
41 = 10n – 10+1
10n= 41-1+10
N = 5
3
4
5
6
Subscribe
Login
0 Comments