Interleave lower bound

In the theory of Optimal binary search trees, the interleave lower bound is a lower bound on the number of operations required by a binary search…