Suppose n is the number of nodes in a complete Binary Tree then-03642
Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Mid Term - Quiz No.13.
Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are
Log2 (n+1) -1
Log2 (n+1)
Log2 (n) – 1
Log2 (n)
