deepaktiwari88/Self-Balancing-BSTs

A self-balancing binary search tree 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.

C++MIT