1 problem

Let $X\in[n]^m$ be an access sequence, and let $\operatorname{\mathsf{OPT}}(X)$ denote the cost of an optimal binary search tree serving $X$. A sequence is pattern-avoiding if it a…