BST Algorithm (Duplicate Elimination Duplicate Elimination)

From Algorithm Wiki

Revision as of 11:21, 3 May 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(\log n)$ words

(Derived: Space required for the recursion stack space)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1999

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=BST_Algorithm_(Duplicate_Elimination_Duplicate_Elimination)&oldid=48033"