A complete n-ary tree is a tree in which each node has n children or no…
GATE · 2007 · CS
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?
- A.
3
- B.
4
- C.
5
- D.
6
Attempted by 455 students.
Sign up free to check your answer
Sign up freeLoading lesson…