recategorized by
2,958 views

2 Answers

1 votes
1 votes

hieght of complete binary tree=$\left \lceil log _{2}n \right \rceil$

=$\left \lceil log _{2}63 \right \rceil$

=$\left \lceil 5.9 \right \rceil$

=6

Alternative

max number of nodes = $2^{(h+1)}-1$  put value $h=6$

= $2^{6}-1$ 

=$63$ number of node given in complete binart tree

Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Mar 31, 2020
939 views
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
2 votes
2 votes
1 answer
2
admin asked Mar 31, 2020
4,363 views
The address field of linked list : Contain address of next node May contain null characterContain address of next pointerBoth $\left (A \right)$ and $\left ( B \right)$
2 votes
2 votes
4 answers
4