In the worst case of deletion in AVL tree requires-03645
In the worst case of deletion in AVL tree requires __________.
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.14.
In the worst case of deletion in AVL tree requires __________.
Only one rotation
Rotation at each non-leaf node
Rotation at each leaf node
Rotations equal to log2 N
