sentences:  The total number of switches (summed over all nodes) gives an asymptotic lower bound on the work done by any binary search tree algorithm on the given access sequence.This is called the "interleave lower bound".In order to connect this to tango trees, we will find an upper bound on the work done by the tango tree for a given access sequence.