AVL Tree
Self-Balancing BSTO(log n)A self-balancing BST where every node's balance factor (BF = left height − right height) stays within {-1, 0, 1}.
A self-balancing BST where every node's balance factor (BF = left height − right height) stays within {-1, 0, 1}.