Left rotation

Left rotation refers to the following

In a binary search tree, pushing a node N down and to the left to balance the tree. N's right child replaces N, and the right child's left child becomes N's right child.
In an array, moving all items to the next lower location. The first item is moved to the last location, which is now vacant.
In a list, removing the head and inserting it at the tail.

This computer science-related article is a stub. You can help Wikipedia by expanding it.