A self-balancing binary search tree designed to guarantee lower worst-case running time for insertion, deletion, and search operations than many other self-balancing search trees.
A self-balancing binary search tree designed to guarantee lower worst-case running time for insertion, deletion, and search operations than many other self-balancing search trees.