A complete binary tree having N nodes consists of Levels-03492
A complete binary tree having "N" nodes consists of __________ Levels.
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.19.
A complete binary tree having "N" nodes consists of __________ Levels.
Log2 (N+1) -1
Log2 (N-1) -1
Log2 (N+1) +1
Log2 (N-1) +1
