Category:Balanced trees
Jump to navigation
Jump to search
The article Balanced trees on Wikipedia projects: a tree data structure where no leaf is much farther away from the root than any other leaf  | |||||
| Upload media | |||||
| Subclass of | |||||
|---|---|---|---|---|---|
| Different from | |||||
| |||||
 | |||||
A balanced trees, or self-balancing (or height-balanced) binary search tree in computer science, is any node-based binary search tree that automatically keeps its height (number of levels below the root) small in the face of arbitrary item insertions and deletions
Subcategories
This category has the following 3 subcategories, out of 3 total.
Media in category "Balanced trees"
The following 14 files are in this category, out of 14 total.
-
Balanced tree.png 1,351 × 934; 12 KB
-
Balancierter Baum - Baum ohne Werte.PNG 357 × 273; 5 KB
-
Balancierter Baum - Baum ohne Werte.svg 428 × 368; 1 KB
-
Balancierter Baum - entarteter Suchbaum.PNG 239 × 258; 3 KB
-
Balancierter Binärbaum.jpg 934 × 222; 102 KB
-
Balancierter Binärbaum2.jpg 957 × 222; 102 KB
-
Leafs-trees.jpg 1,970 × 4,160; 3.92 MB
-
Tree leaf.jpg 1,200 × 1,200; 111 KB
-
Tree234 example1.svg 620 × 258; 21 KB
-
Tree234 node2.svg 104 × 148; 6 KB
-
Tree234 node3.svg 104 × 148; 9 KB
-
Tree234 node4.svg 114 × 148; 10 KB
-
Unbalanced tree.png 1,100 × 500; 5 KB
-
Unbalanced tree.svg 408 × 208; 1 KB
