What is the worst case analysis of an AA-Tree?

Category: QuestionsWhat is the worst case analysis of an AA-Tree?
Editor">Editor Staff asked 1 month ago

What is the worst case analysis of an AA-Tree?
 
(a) O(N)
 
(b) O(log N)
 
(c) O( N log N)
 
(d) O(N^2)
 
I’m obligated to ask this question of Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I
 
I had been asked this question by my college professor while I was bunking the class.

1 Answers
Editor">Editor Staff answered 1 month ago

Right answer is (b) O(log N)
 
The best explanation: The worst case analysis of an AA-Tree is mathematically found to be O(log N).