Tango tree
id:
tango-tree-294-9903724
title:
Tango tree
text:
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. It is named after Buenos Aires, of which the tango is emblematic. It is an online binary search tree that achieves an O competitive ratio relative to the offline optimal binary search tree, while only using O additional bits of memory per node. This improved upon the previous best known competitive ratio, which was O .
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Tango_tree
date created:
date modified:
2022-03-11T09:17:40Z
main entity:
{"identifier":"Q7683117","url":"https://www.wikidata.org/entity/Q7683117"}
image:
fields total:
13
integrity:
13