Treap ( Self-Balancing Trees Creation)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O(n)$ words

(Need to keep track of intermediary stages of tree before outputting)

Description

Approximate?

Exact

Randomized?

Yes,

Model of Computation

Word RAM

Year

1989

Reference

http://faculty.washington.edu/aragon/pubs/rst89.pdf