sentences:  Once we find an upper bound on the performance of the tango tree, we can divide them to bound the competitive ratio.To find a lower bound on the work done by the optimal offline binary search tree, we again use the notion of preferred children.When considering an access sequence (a sequence of searches), we keep track of how many times a reference tree node's preferred child switches.