Self-balancing trees search
Revision as of 12:00, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== A tree is model used to represent hierarchical data. In correspondence to natural trees, it has nodes, leaves and branches. A commonly mentioned tree is a binary tree, in which each node contains leads to two other nodes. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" w...")
Problem Description
A tree is model used to represent hierarchical data. In correspondence to natural trees, it has nodes, leaves and branches. A commonly mentioned tree is a binary tree, in which each node contains leads to two other nodes.
Bounds Chart
Step Chart
Improvement Table
| Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
|---|---|---|
| Exp/Factorial | ||
| Polynomial > 3 | ||
| Cubic | ||
| Quadratic | ||
| nlogn | ||
| Linear | ||
| logn | [ 2-3 Tree (1970)] |