Category:Binary trees

From Wikimedia Commons, the free media repository
Jump to: navigation, search
 The article Binary trees on Wikipedia projects: (en) Binary tree ·
(ar) شجرة ثنائية · (bg) Двоично дърво · (ca) Arbre binari · (cs) Binární strom · (de) Binärbaum · (eo) Duuma arbo · (es) Árbol binario · (fi) Binääripuu · (fr) Arbre binaire · (he) עץ בינארי · (hi) बाइनरी ट्री · (id) Pohon biner · (is) Tvíundatré · (it) Albero binario · (ja) 二分木 · (ko) 이진 트리 · (pl) Drzewo binarne · (pt) Árvore binária · (ro) Arbore binar · (ru) Двоичное дерево · (sk) Binárny strom (teória grafov) · (sl) Dvojiško drevo · (sr) Бинарно стабло · (sv) Binärträd · (th) ต้นไม้ทวิภาค · (uk) Двійкове дерево · (zh) 二叉树 · +/−

A binary tree in computer science is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.

Subcategories

This category has the following 9 subcategories, out of 9 total.

B

C

C cont.

K

R

S

T

Media in category "Binary trees"

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

(previous 200) (next 200)(previous 200) (next 200)