Category:Binary trees

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
binary tree 
tree data structure in which each node has at most two children
Binary tree.svg
Upload media
Wikipedia-logo-v2.svg  Wikipedia
Instance ofabstract data type
Subclass ofk-ary tree,
tree data structure,
arborescence
Authority control
Blue pencil.svg
árbol binario (es); Tvíundatré (is); двоичное дерево (ru); Binärbaum (de); Pemët binare (sq); бинарно стабло (sr-ec); Двоично дърво (bg); 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); Kahendpuu (et); बाइनरी ट्री (hi); Cây nhị phân (vi); درخت دودویی (fa); 二叉树 (zh); binarno stablo (sr-el); 二分木 (ja); binárny strom (sk); árvore binária (pt); бинарно стабло (sr); Dvojiško drevo (sl); ต้นไม้แบบทวิภาค (th); 二元樹 (zh-tw); 二叉树 (zh-sg); Хоёртын мод (mn); Drzewo binarne (pl); arbre binari (ca); binaire boom (nl); Pohon biner (id); binääripuu (fi); двійкове дерево (uk); İkili Ağaç (tr); binary tree (en); شجرة ثنائية (ar); 二叉树 (zh-hans); Binarno stablo (sh) struttura ad albero in cui ogni nodo ha al più due figli (it); structure de données (fr); drzewo, w ktorym każdy wierzchołek ma dwoje dzieci (pl); 每個節點至多有兩個小孩的樹狀資料結構 (zh-tw); ациклический граф, в котором у каждой вершины не более 2 потомков (ru); 每個節點至多有兩個小孩的樹狀資料結構 (zh-hant); puu, jonka solmuilla on korkeintaan kaksi lasta (fi); tree data structure in which each node has at most two children (en); 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); 计算机科学中一种数据结构 (zh); datastructuur (nl) arbol binario (es); 2分木, バイナリツリー, 根付き二分木 (ja); Tvíundahrísla, Tvíundartré (is); עץ בינרי (he); dichotome boom (nl); бинарное дерево, биномиальное дерево (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 14 subcategories, out of 14 total.

B

C

K

R

S

T

Media in category "Binary trees"

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

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