+1 vote
in Data Structures & Algorithms I by (110k points)
In an AA-tree, we process split first, followed by a skew.

(a) True

(b) False

My question is based upon Binary Trees in division Binary Trees of Data Structures & Algorithms I

This question was addressed to me in an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct answer is (b) False

For explanation: In an AA-tree, skew is processed first followed by a split.

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.