Self-Balancing Trees Search: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Self-Balancing Trees Search (Self-Balancing Trees Search)}} == Description == Search for a given element within 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
 
(4 intermediate revisions by the same user not shown)
Line 6: Line 6:
== Parameters ==  
== Parameters ==  


<pre>n: size of tree</pre>
$n$: size of tree


== Table of Algorithms ==  
== Table of Algorithms ==  
Line 16: Line 16:
|-
|-


| [[Hopcroft 2-3 Tree ( Self-Balancing Trees Search)|Hopcroft 2-3 Tree]] || 1970 || $O(logn)$ || $O({1})$ || Exact || Deterministic ||   
| [[Hopcroft 2-3 Tree ( Self-Balancing Trees Search)|Hopcroft 2-3 Tree]] || 1970 || $O(\log n)$ || $O({1})$ || Exact || Deterministic ||   
|-
|-
| [[Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Search)|Guibas, Sedgewick Red-Black Tree]] || 1972 || $O(logn)$ || $O({1})$ || Exact || Deterministic || [https://ieeexplore.ieee.org/document/4567957 Time]
| [[Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Search)|Guibas, Sedgewick Red-Black Tree]] || 1972 || $O(\log n)$ || $O({1})$ || Exact || Deterministic || [https://ieeexplore.ieee.org/document/4567957 Time]
|-
|-
| [[AVL Tree ( Self-Balancing Trees Search)|AVL Tree]] || 1962 || $O(logn)$ || $O({1})$ || Exact || Deterministic ||   
| [[AVL Tree ( Self-Balancing Trees Search)|AVL Tree]] || 1962 || $O(logn)$ || $O({1})$ || Exact || Deterministic ||   
Line 34: Line 34:
|}
|}


== Time Complexity graph ==  
== Time Complexity Graph ==  


[[File:Self-Balancing Trees Search - Time.png|1000px]]
[[File:Self-Balancing Trees Search - Time.png|1000px]]
== Space Complexity graph ==
[[File:Self-Balancing Trees Search - Space.png|1000px]]
== Pareto Decades graph ==
[[File:Self-Balancing Trees Search - Pareto Frontier.png|1000px]]

Latest revision as of 09:12, 28 April 2023

Description

Search for a given element within 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({1})$ Exact Deterministic
Scapegoat Tree 1989 $O(nlogn)$ $O({1})$? Exact Deterministic Time
Treap 1989 $O(n)$ $O({1})$? Exact Randomized Time
Tango Tree 2004 $O((k+{1})$log(log(n))) Exact Deterministic Time

Time Complexity Graph

Self-Balancing Trees Search - Time.png