edited by
902 views
1 votes
1 votes

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$:

  1. $3^i$
  2. $3i$
  3. $3$
  4. $3i+1$
edited by

1 Answer

Related questions

1 votes
1 votes
2 answers
1
0 votes
0 votes
1 answer
2
go_editor asked Mar 28, 2020
1,709 views
Which of the following data structure is used to implement recursion ?ArraysStacksQueuesLinked lists
1 votes
1 votes
1 answer
3
go_editor asked Mar 28, 2020
1,153 views
The height of a binary tree with $n$ nodes, in the worst case is :$O(log n)$$O(n)$$\Omega(n\log n)$$\Omega(n^2)$
2 votes
2 votes
1 answer
4