+1 vote
in Data Structures & Algorithms I by (110k points)
How will you remove a left horizontal link in an AA-tree?

(a) by performing right rotation

(b) by performing left rotation

(c) by deleting both the elements

(d) by inserting a new element

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

I have been asked this question in final exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (a) by performing right rotation

The explanation is: A left horizontal link is removed by right rotation.  A right horizontal link is removed 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.