Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees