Tarjan Splay Tree ( Self-Balancing Trees Deletion)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ words

(^see above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1985

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Tarjan_Splay_Tree_(_Self-Balancing_Trees_Deletion)&oldid=45717"