Definition: To switch children and parents among two or three adjacent nodes to restore balance to a tree.

See also left rotation, right rotation, balanced tree.

Note: A rotation may change the depth of some nodes, but does not change their relative ordering.

Author: PMS

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul M. Sant, "rotation", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: