Self-balancing binary search tree

In computer science, a self-balancing binary search tree (BST) is any node-based Binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.

(“Self-Balancing Binary Search Tree” 2022)

Implementations

• Red-black tree
• B-tree

Bibliography

Backlinks

• B-tree
• Red-black tree