Q37
What is the time complexity for deleting a node in an AVL tree?
A.
O(1)
B.
O(log2 n)
C.
O(log n)
AnswerD.
O(n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board