Tango tree

A tango tree is a type of binary search tree proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Patrascu in 2004. It is named after Buenos Aires, sometimes considered as the Tango World Capital.

It is an online binary search tree that achieves an ${\displaystyle O(\log \log n)}$ competitive ratio relative to the optimal offline binary search tree, while only using ${\displaystyle O(\log \log n)}$ additional bits of memory per node. This improved upon the previous best known competitive ratio, which was ${\displaystyle O(\log n)}$.

...
Wikipedia