If a complete binary tree has n number of nodes then its height-03504
If a complete binary tree has n number of nodes then its height will be
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Final Term - Quiz No.20.
If a complete binary tree has n number of nodes then its height will be
Log2(n+1)-1
2n
2n-1
2n - 1
