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