◘ What are AVL Trees :
• AVL Trees are self-balancing Binary Search Trees (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
◘ Topics to be Covered :
• Basics of AVL
• Rotations in AVL
• Insertion in AVL
◘ About the Java DS-Algo (Online) Course :
• All details about the online course are available on the Facebook event here: https://cb.lk/JavaOL/Fb and the course website here: https://cb.lk/JavaOL/Web
• Use promo code HNY2018 to avail a discount of 18% off the course fees.
◘ Link for Code : https://github.com/coding-blocks-archives/JavaWebinars/tree/master/src/AVLTree
