+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...