Tango Tree ( Self-Balancing Trees Search)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O((k+{1})$log(log(n)))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

http://erikdemaine.org/papers/Tango_SICOMP/paper.pdf