Self-Balancing Trees Deletion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: size of tree | $n$: size of tree | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 16: | Line 16: | ||
|- | |- | ||
| [[Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion)|Hopcroft 2-3 Tree]] || 1970 || $O( | | [[Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion)|Hopcroft 2-3 Tree]] || 1970 || $O(\log n)$ || $O({1})$ || Exact || Deterministic || | ||
|- | |- | ||
| [[Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion)|Guibas, Sedgewick Red-Black Tree]] || 1972 || $O( | | [[Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion)|Guibas, Sedgewick Red-Black Tree]] || 1972 || $O(\log n)$ || $O({1})$ || Exact || Deterministic || [https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/4567957 Time] | ||
|- | |- | ||
| [[AVL Tree ( Self-Balancing Trees Deletion)|AVL Tree]] || 1962 || $O(logn)$ || $O({1})$ || Exact || Deterministic || | | [[AVL Tree ( Self-Balancing Trees Deletion)|AVL Tree]] || 1962 || $O(logn)$ || $O({1})$ || Exact || Deterministic || | ||
| Line 35: | Line 35: | ||
[[File:Self-Balancing Trees Deletion - Time.png|1000px]] | [[File:Self-Balancing Trees Deletion - Time.png|1000px]] | ||
Latest revision as of 10:12, 28 April 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(\log n)$ | $O({1})$ | Exact | Deterministic | |
| Guibas, Sedgewick Red-Black Tree | 1972 | $O(\log n)$ | $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 |
Time Complexity Graph
