+1 vote
in Data Structures & Algorithms I by (110k points)
What is the prime condition of AA-tree which makes it simpler than a red-black tree?

(a) Only right children can be red

(b) Only left children can be red

(c) Right children should strictly be black

(d) There should be no left children

My question is from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

I have been asked this question in an interview for job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) Only right children can be red

Explanation: The prime condition of AA-Tree is that only the right children can be red to eliminate possible restructuring cases.

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.