Self-Balancing Trees Deletion: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Self-Balancing Trees Deletion (Self-Balancing Trees Deletion)}} == Description == Delete a given element from a self-balancing tree. == Parameters == <pre>n: size of tree</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Hopcroft 2-3 Tree || 1970 || $O(logn)...") |
No edit summary |
||
Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: size of tree | |||
== Table of Algorithms == | == Table of Algorithms == |
Revision as of 12:03, 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 |