Self-Balancing Trees Deletion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
Line 40: | Line 40: | ||
[[File:Self-Balancing Trees Deletion - Space.png|1000px]] | [[File:Self-Balancing Trees Deletion - Space.png|1000px]] | ||
== | == Time-Space Tradeoff == | ||
[[File:Self-Balancing Trees Deletion - Pareto Frontier.png|1000px]] | [[File:Self-Balancing Trees Deletion - Pareto Frontier.png|1000px]] |
Revision as of 14:47, 15 February 2023
Description
Delete a given element from a self-balancing tree.
Parameters
n: size of tree
Table of Algorithms
Name | Year | Time | Space | Approximation Factor | Model | Reference |
---|---|---|---|---|---|---|
Hopcroft 2-3 Tree | 1970 | $O(logn)$ | $O({1})$ | Exact | Deterministic | |
Guibas, Sedgewick Red-Black Tree | 1972 | $O(logn)$ | $O({1})$ | Exact | Deterministic | Time |
AVL Tree | 1962 | $O(logn)$ | $O({1})$ | Exact | Deterministic | |
Tarjan Splay Tree | 1985 | $O(n)$ | $O({1})$ | Exact | Deterministic | |
Bayer, McCreight B-Tree | 1970 | $O(b*log(n)$/log(b))? | $O(b)$? | Exact | Deterministic | |
Scapegoat Tree | 1989 | $O(n)$ | $O({1})$? | Exact | Deterministic | Time |
Treap | 1989 | $O(n)$ | $O({1})$? | Exact | Randomized | Time |