Update readme;

Author: Antondomashnev

AVL Tree/README.markdown

@@ -45,20 +45,21 @@ If after an insertion or deletion the balance factor becomes greater than 1, the
 ## Rotations
 Each tree node keeps track of its current balance factor in a variable. After inserting a new node, we need to update the balance factor of its parent node. If that balance factor becomes greater than 1, we "rotate" part of that tree to restore the balance.
 
-Example of balancing the unbalanced tree using *Right* (clockwise direction) rotation :
-![Rotation](Images/Rotation.jpg)
+Example of balancing the unbalanced tree using *Right* (clockwise direction) rotation:
+![Rotation0](Images/RotationStep0.jpg)
 
-Let's dig into rotation algorithm in detail using the terminology:
+For the rotation we're using the terminology:
 * *Root* - the parent not of the subtrees that will be rotated;
 * *Pivot* - the node that will become parent (basically will be on the *Root*'s position) after rotation;
 * *RotationSubtree* - subtree of the *Pivot* upon the side of rotation
 * *OppositeSubtree* - subtree of the *Pivot* opposite the side of rotation
 
+![Rotation1](Images/RotationStep1.jpg) ![Rotation2](Images/RotationStep2.jpg) ![Rotation3](Images/RotationStep3.jpg)
+
 The steps of rotation on the example image could be described by following:
-* Select the *Pivot* as `D` and hence the *Root* as `F`;
-* Assign the *RotationSubtree* as a new *OppositeSubtree* for the *Root*;
-* Assign the *Root* as a new *RotationSubtree* for the *Pivot*;
-* Check the final result
+1. Assign the *RotationSubtree* as a new *OppositeSubtree* for the *Root*;
+2. Assign the *Root* as a new *RotationSubtree* for the *Pivot*;
+3. Check the final result
 
 In pseudocode the algorithm above could be written as follows:
 ```