1 problem

A binary search tree (BST) algorithm is $O(1)$-competitive if its cost on every access sequence is at most a constant factor times the cost of the optimal offline BST algorithm, up…