Searching an element in an AVL tree take maximum in AVL tree-03671
Searching an element in an AVL tree take maximum in AVL tree
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.16.
Searching an element in an AVL tree take maximum in AVL tree
Log2(n+1) time (where n is no. of nodes
Log2(n+1) -1
1.44 Log2n
1.66 Log2n
