Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion)
Jump to navigation
Jump to search
Time Complexity
$O(\log n)$
Space Complexity
$O({1})$ words
(^see above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1972
Reference
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/4567957