This is a self-balancing AVL binary search tree where insertion, deletion, and lookup are guaranteed to take O(log n) in the worst-case. The tree is maintained by ensuring that the heights of each node's child subtrees differ by at most 1.
To run tests, run ./test.bash.
Documentation here!