Tango tree
From Wikipedia, the free encyclopedia
A tango tree is a type of binary search tree proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătrașcu in 2004.[1] It is named after Buenos Aires, of which the tango is emblematic.
This article relies largely or entirely on a single source. (March 2021) |
It is an online binary search tree that achieves an competitive ratio relative to the offline optimal binary search tree, while only using additional bits of memory per node. This improved upon the previous best known competitive ratio, which was .