Self-Balancing Trees

← Back to Tree Structures

Binary search trees that automatically maintain balance after insertions and deletions, guaranteeing O(log n) operations in the worst case.

Key Properties

• AVL Trees
• Red-Black Trees
• B-Trees
• B+ Trees

Related

• Binary Search Trees (unbalanced version)
• Relational Databases (B-Trees/B+ Trees used for indexing)

---

data-structures trees balanced-trees