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 an online binary search tree that achieves an competitive ratio relative to the optimal offline binary search tree, while only using additional bits of memory per node. This improved upon the previous best known competitive ratio, which was .
Famous quotes containing the word tree:
“The windy springs and the blazing summers, one after another, had enriched and mellowed that flat tableland; all the human effort that had gone into it was coming back in long, sweeping lines of fertility. The changes seemed beautiful and harmonious to me; it was like watching the growth of a great man or of a great idea. I recognized every tree and sandbank and rugged draw. I found that I remembered the conformation of the land as one remembers the modelling of human faces.”
—Willa Cather (1873–1947)