Self-Balancing Trees Insertion: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 35: Line 35:


[[File:Self-Balancing Trees Insertion - Time.png|1000px]]
[[File:Self-Balancing Trees Insertion - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Self-Balancing Trees Insertion - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Self-Balancing Trees Insertion - Pareto Frontier.png|1000px]]

Latest revision as of 10:11, 28 April 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(\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

Self-Balancing Trees Insertion - Time.png