This video is on details of AVL tree (balanced binary search tree), its creation, insertion, deletion and searching. Here, we have shown with example how to create an avl tree with details of every step. Then again shows an example of insertion where the balance is getting disturbed at the lower level of the tree. Then we have shown how to delete from the AVL tree with many exmples with various kinds of situation. Searching is done on AVL tree as binary search tree, though we have shown to complete the tasks of AVL tree. We give details of how to balance the tree using 4 rotation:RR rotation, LL rotation, RL rotation, LR rotation. It is a complete guide to know and work with AVL tree.
