Data Structure in CS - AVL Tree - Rotation in AVL Tree | LL, RR, LR, RL | Data Structure

In this video, I will explain Avl Tree rotation in the data structure in Hindi. To balance itself, an AVL tree may perform the following four kinds of rotations − Left rotation - LL Right rotation - RR Left-Right rotation - LR Right-Left rotation - RL The difference between the depth of right and left subtrees cannot be more than one. In order to maintain this guarantee, and implementation of an AVL will include an algorithm to rebalance the tree when adding an additional element would upset this guarantee. Single Left Rotation (LL Rotation) Single Right Rotation (RR Rotation) Left Right Rotation (LR Rotation) Right Left Rotation (RL Rotation) AVL TREE in Data structure Binary Search tree in Data structure AVL rotation in Data structure Data structure Tutorial Please Like Share and Subscribe CSE Gyan Cs Engineering Gyan Teacher: Kailash Joshi Editor: Bipin Chandra Thank You