Balanced trees such as AVL or Red‑Black are self‑balancing binary search trees that keep height proportional to log n by performing rotations after inserts and deletes. This guarantees search/insert/delete in O(log n) even in the worst case.