731 views
0 votes
0 votes

Total number of nodes at the nth  level of a full binary tree can be given as___________. 

 

  1. 2n + 1
  2. $2n^{2}$
  3. 2^n
  4. 2n – 1

1 Answer

3 votes
3 votes

Depends on the definition of full  binary tree. 

According to the def of full binary tree given in wiki, it is not fixed.

Binary tree - Wikipedia

For perfect binary tree ans will be C.

Related questions

1 votes
1 votes
0 answers
1
rsansiya111 asked Dec 6, 2021
408 views
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
0 votes
0 votes
1 answer
2
rsansiya111 asked Dec 6, 2021
382 views
Worst Case scenario in case of linear search algorithm is_______________.Item is somewhere in the middle of the arrayItem is not in the array at allItem is the last eleme...
0 votes
0 votes
1 answer
3
rapidxy asked Dec 14, 2021
391 views
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is :A)40(2)^40 B)40(2)^39C)41(2)^40D)41(2)^39
0 votes
0 votes
0 answers
4
rsansiya111 asked Dec 6, 2021
187 views
Consider a relation R with attributes {A,B,C} and functional dependency set S ={A → B, A → C}. Then relation R can be decomposed into two relations: R1{A,B} AND R2{A...