rbst

This package contains an implementation of a Randomized Binary Search Tree. Randomized Binary Search Trees are guaranteed to be Random BST irrespective of the number of insert / delete operations. This guarantees logarithmic time operations (with a constant factor) in the worst case.