self-balancing search tree

A self-balancing search tree is a binary search tree that automatically adjusts its structure during insertions and deletions to maintain near-optimal height for efficient search, insertion, and deletion operations.

Instances (1)

• B-tree