A self-balancing binary search tree where the height difference between left and right subtrees is guaranteed to be at most one.
A self-balancing binary search tree where the height difference between left and right subtrees is guaranteed to be at most one.