Search:

https://en.wikipedia.org/wiki/Tree_rotation

Actually, this is dead-easy. Simple pseudocode follows:

While the root is not null
if the left node of the root is not null
perform a right rotation about the root
else
...