Searching of an element in an AVL tree take minimum time where-03311
Searching of an element in an AVL tree take minimum __________ time (where n is number of nodes 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 Final Term - Quiz No.1.
Searching of an element in an AVL tree take minimum __________ time (where n is number of nodes in AVL tree)
Log2(n+1)
Log2(n+1) -1
1.44 Log2n
1.66 Log2n
