+1 vote
in Data Structures & Algorithms I by (110k points)
What are the two different operations done in an AA-Tree?

(a) shift and color

(b) skew and split

(c) zig and zag

(d) enqueue and dequeue

My doubt stems from Binary Trees in section Binary Trees of Data Structures & Algorithms I

This question was addressed to me in an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct option is (b) skew and split

The best explanation: A skew removes a left horizontal link by right rotation and a split removes a right horizontal link by left rotation.

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.