RIGHT-ROTATE(T, x)
1 y ← left[x] ▹ Set y.
2 left[x] ← right[y] ▹ Turn y's right subtree into x's left subtree.
3 p[right[y]] ← x
4 p[y] ← p[x] ▹ Link x's parent to y.
5 if p[x] = nil[T]
6 then root[T] ← y
7 else if x = right[p[x]]
8 then right[p[x]] ← y
9 else left[p[x]] ← y
10 right[y] ← x ▹ Put x on y's right.
11 p[x] ← y