Welcome to the AVL Tree learning module! In AVL Trees, the heights of the two child subtrees of any node differ by at most one. Study standard balance factor criteria and tree rotations in your DSA courses, and practice the interactive BST visualizers in the sidebar.
Named after its inventors Adelson-Velsky and Landis, the AVL Tree is the first self-balancing binary search tree. In an AVL Tree, each node maintains a Balance Factor (defined as the height difference between the left and right subtrees: Height_left - Height_right). For any node to remain balanced, its Balance Factor must belong to the set {-1, 0, 1}.