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

References

“Self-Balancing Binary Search Tree.” 2022. Wikipedia, June. https://en.wikipedia.org/w/index.php?title=Self-balancing_binary_search_tree&oldid=1092928206.

Backlinks