Category:Binary trees

From Wikimedia Commons, the free media repository
Jump to navigation Jump to 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) 二叉树 · +/−
binary tree 
tree data structure in which each node has at most two children
Binary tree.svg
Wikipedia-logo-v2.svg  Wikipedia
Instance of abstract data type
Subclass of k-ary tree,
tree data structure,
arborescence
Authority control
Wikidata
Blue pencil.svg
árbol binario (es); Tvíundatré (is); двоичное дерево (ru); Binärbaum (de); Pemët binare (sq); бинарно стабло (sr-ec); 二叉树 (zh); arbore binar (ro); 二叉樹 (zh-hk); Binärträd (sv); עץ בינארי (he); 二元樹 (zh-hant); 二叉树 (zh-cn); 이진 트리 (ko); duuma arbo (eo); binární strom (cs); binarno stablo (bs); albero binario (it); arbre binaire (fr); बाइनरी ट्री (hi); двійкове дерево (uk); binarno stablo (sr-el); Binääripuu (fi); درخت دودویی (fa); 二分木 (ja); бинарно стабло (sr); Dvojiško drevo (sl); binárny strom (sk); árvore binária (pt); 二叉树 (zh-sg); Хоёртын мод (mn); Drzewo binarne (pl); ต้นไม้แบบทวิภาค (th); Binarno stablo (sh); 二元樹 (zh-tw); arbre binari (ca); İkili Ağaç (tr); Pohon biner (id); binary tree (en); شجرة ثنائية (ar); 二叉树 (zh-hans); Двоично дърво (bg) Bilgisayar bilimlerinde ve yazılım alanında kullanılan her bir düğüm'ün (node) en fazla iki alt düğüme sahip olduğu ağaç yapısıdır. (tr); struttura ad albero in cui ogni nodo ha al più due figli (it); structure de données (fr); ациклический граф, в котором у каждой вершины не более 2 потомков (ru); tree data structure in which each node has at most two children (en); drzewo, w ktorym każdy wierzchołek ma dwoje dzieci (pl); 每個節點至多有兩個小孩的樹狀資料結構 (zh-hant); 每個節點至多有兩個小孩的樹狀資料結構 (zh-tw) arbol binario (es); 2分木, バイナリツリー, 根付き二分木 (ja); Tvíundahrísla, Tvíundartré (is); עץ בינרי (he); бинарное дерево, биномиальное дерево (ru); Linearisierung von Binärbäumen, Rechtes Kind, Post-order, Binärer Baum, Linkes Kind, Pre-order, In-order, Binary Tree (de); 이진트리 (ko); Бінарне дерево (uk); Binära träd, Binärt träd (sv); 二元樹 (zh); binary tree (sr)

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 13 subcategories, out of 13 total.

B

C

K

R

S

T

Media in category "Binary trees"

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

(previous page) (next page)(previous page) (next page)