retagged by
1,049 views

3 Answers

2 votes
2 votes

 

Total number of level=$k$ 

At  level 0 number of node=$ 2^{0} $

 At level 1 number of node =$2^{1}$

 At level 2 number of node =$2^{2}$

 At level 3 number of node =$2^{3}$

 At level 4 number of node =$2^{4}$

 At level 5 number of node =$2^{5}$..

.

.

.

.At level k number of node =$2^{k-1}$

Total number of node in complete binary tree=$ 2^{0} $+$2^{1}$+$2^{2}$+$2^{3}$+$2^{4}$.....................$2^{k-1}$

$\left \{  1(2^{k}-1)/2-1\right \}$

=$2^{k}-1$

 

1 votes
1 votes
Since, they are asking in terms of levels answer would be 2^k -1
Answer:

Related questions

1 votes
1 votes
5 answers
1
admin asked Mar 31, 2020
1,547 views
Which of the following need not be a binary tree?Search treeHeapAVL treeB tree
1 votes
1 votes
2 answers
3
admin asked Mar 31, 2020
3,858 views
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as:normalization of data.denomination of data.isolatio...
2 votes
2 votes
3 answers
4
admin asked Mar 31, 2020
744 views
If $L1$ is CFL and $L2$ is regular language which of the following is false?$L1-L2$ is not Context free$L1$ intersection $L2$ is Context free$\sim L1$ is Context freeBoth...