+1 vote
in Data Structures & Algorithms I by (110k points)
AA Trees are implemented using?

(a) Colors

(b) Levels

(c) Node size

(d) Heaps

My question comes from Binary Trees topic in division Binary Trees of Data Structures & Algorithms I

I have been asked this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct answer is (b) Levels

The best I can explain: AA Trees are implemented using levels instead of colors to overcome the disadvantages of Red-Black trees.

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.