Image:Tree rotation.png

From Wikipedia, the free encyclopedia

[edit] Summary

Left and Right rotations on a binary tree. Needs a minimum of two nodes, P & Q to rotate. A right rotation is performed about P and left rotation is performed about Q.Ther are two type of rotation.they are 1 single rotation 2 double rotation

If insertion makes from left of left or right of right, then we use singl rotation.
If inserton makes from left of right or right of left,then we use double rotation.

[edit] Licensing

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current16:59, 27 August 2006612×241 (30 KB)Ramasamy (Talk | contribs) ((ramasamy, ,Tree Rotation) )

The following file is a duplicate of this file:

The following pages on the English Wikipedia link to this file (pages on other projects are not listed):