UGC NET CSE | December 2007 | Part 2 | Question: 21

Question

Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > $0$) of the tree ? Assume that the root is at level $0$:

• A. $3^i$
• B. $3i$
• C. $3$
• D. $3i+1$

Answer 1

Level => No. of nodes

0 => 1

1 => 3

2 => 9

and so on.

Hence, option A is correct.