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.