sentences:  To construct a tango tree, we simulate a complete binary search tree called the "reference tree", which is simply a traditional binary search tree containing all the elements.This tree never shows up in the actual implementation, but is the conceptual basis behind the following pieces of a tango tree.First, we define for each node its "preferred child", which informally is the most-recently touched child by a traditional binary search tree lookup.