Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 20
What does this rotation do in a self-balancing BST?
y x / \ / \ x C ──▶ A y / \ / \ A B B C
A
Converts the tree to a heap
B
A right rotation at y, preserving in-order order A x B y C while reducing left height
C
Swaps the values of x and y only
D
Deletes y