AVL Tree Visually Explained

this video contains a visual explanation of the AVL Tree data structure which is a self balancing binary search tree. this video contains the animations of the operations and concepts to make it more efficient to learn. The language used in the implementation is Python. Implementation code link:- https://github.com/ByteQuest0/Implemention_codes/blob/main/Trees/AVL.py 0:00 - 0:35 AVL Tree Need 0:35 - 1:42 Balance Factor 1:42 - 3:27 Code Of Node and AVL Tree 3:28 - 9:50 Cases and Condition of Rotations 9:51 - 11:13 Rebalance method 11:13 - 12:08 Insertion and Deletion 12:08 - 13:29 AVL Tree Operations This channel also has similar animated algorithms and data structure videos that you might find useful:- Knuth-Morris-Pratt Algorithm:- https://youtu.be/q4_90fOoS-s Depth First Search Algorithm:- https://youtu.be/84jNzUOY78c Graphs Introduction:- https://youtu.be/OpW4exs0PHI Binary Search Trees:- https://youtu.be/vPfLvtk9dfk Linked Lists:- https://youtu.be/PsTvZ_htHT8 Tools Used:- Manim (open-source animation Library), Python, Premier Pro. Music used:- Sovereign by Kevin MacLeod | https://incompetech.com/ Music promoted by https://www.chosic.com/free-music/all/ Creative Commons CC BY 3.0 https://creativecommons.org/licenses/by/3.0/