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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul M. Sant, "rotation", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/rotation.html