Category:Balanced Trees

From Wikimedia Commons, the free media repository
Jump to: navigation, search
 The article Balanced Trees on Wikipedia projects: (en) Self-balancing binary search tree ·
(de) Balancierter Baum · (es) Árbol binario de búsqueda auto-balanceable · (fr) Arbre équilibré · (it) Albero binario di ricerca bilanciato · (ja) 平衡2分探索木 · (th) ต้นไม้ค้นหาแบบทวิภาคที่มีโครงสร้างปรับสมดุลเองได้ · (uk) Збалансоване дерево · (zh) 平衡树 · +/−

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.

A

B

R

Media in category "Balanced Trees"

The following 11 files are in this category, out of 11 total.