Trees

AVL Tree

A self-balancing BST whose subtree heights never differ by more than one.

Learn with an interactive visualization

Category: Trees. Complexity: Search / insert / delete O(log n).

A self-balancing BST whose subtree heights never differ by more than one. Interactive visualization, Java code, operations, complexity, and a complete…