- benchmarks of simple (not self-balancing) BST
- reference implementation + benchmarks
- comparative performance graphs of variations (with/without filtering, intervals, etc)
- benchmarks in comparison to typical explicit-array-based implementation
- full usage example in Readme
- implement insertion with rebuilding/reallocing (based on "Cache Oblivious Search Trees via Binary Trees of Small Height")