Self-Balancing Trees Insertion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 32: | Line 32: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Self-Balancing Trees Insertion - Time.png|1000px]] | [[File:Self-Balancing Trees Insertion - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Self-Balancing Trees Insertion - Space.png|1000px]] | [[File:Self-Balancing Trees Insertion - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Self-Balancing Trees Insertion - Pareto Frontier.png|1000px]] | [[File:Self-Balancing Trees Insertion - Pareto Frontier.png|1000px]] | ||
Revision as of 13:05, 15 February 2023
Description
Insert a given element into 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 |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
