Category:Binary trees

Wikimedia Commons, 자유로운 미디어 저장소

둘러보기로 이동 검색으로 이동

<nowiki>árbol binario; 二元樹; Tvíundatré; двоичное дерево; Binärbaum; Alber binari; Pemët binare; бинарно стабло; Двоично дърво; arbore binar; 二叉樹; binärträd; עץ בינארי; 二元樹; 二叉树; 이진 트리; duuma arbo; binární strom; binarno stablo; albero binario; arbre binaire; बाइनरी ट्री; Kahendpuu; 二叉树; binaire boom; Binarno stablo; 二分木; binárny strom; árvore binária; Cây nhị phân; ต้นไม้แบบทวิภาค; 二元樹; arbre binari; бинарно стабло; dvojiško drevo; binääripuu; Pohon biner; 二叉树; Хоёртын мод; drzewo binarne; двійкове дерево; İkilik ağac; 二叉树; درخت دودویی; İkili Ağaç; binarno stablo; binary tree; شجرة ثنائية; Δυαδικό δέντρο; Binarno stablo; 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.; 每個節點至多有兩個小孩的樹狀資料結構; structure de données; estructura de datos por nodos nacientes de uno; struktur data pohon; drzewo, w ktorym każdy wierzchołek ma dwoje dzieci; datastructuur; 每個節點至多有兩個小孩的樹狀資料結構; ациклический граф, в котором у каждой вершины не более 2 потомков; puu, jonka solmuilla on korkeintaan kaksi lasta; Datenstruktur; tree data structure in which each node has at most two children; tree data structure in which each node has at most two children; نوعی ساختار داده در علوم رایانه; 计算机科学中一种数据结构; struttura ad albero in cui ogni nodo ha al più due figli; binarno drevo; 2分木; バイナリツリー; 根付き二分木; Tvíundahrísla; Tvíundartré; עץ בינרי; dichotome boom; бинарное дерево; биномиальное дерево; arbol binario; Linearisierung von Binärbäumen; Rechtes Kind; Post-order; Binärer Baum; Linkes Kind; Pre-order; In-order; Binary Tree; 이진트리; Бінарне дерево; binära träd; binärt träd; 二元樹; binary tree</nowiki>

이진 트리

tree data structure in which each node has at most two children

미디어 올리기

다음 종류에 속함

추상적 자료형

다음의 하위 개념임

k-ary tree
트리
rooted tree

다음

ternary tree

다음과 다름

B 트리

전거 통제
Q380172 GND ID: 4145532-0 BabelNet ID: 03178845n
Reasonator Scholia Wikidocumentaries PetScan 통계학 WikiMap Locator tool 관련 KML이 들어있는 문서 Search depicted

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.

하위 분류

다음은 이 분류에 속하는 하위 분류 17개 가운데 17개입니다.

Binary trees obsoleted by SVG replacement‎ (14 F)

B

Binary heaps‎ (47 F)
BSP trees‎ (1 C, 16 F)

C

Calkin–Wilf tree and sequence‎ (1 C, 13 F)
Cartesian trees‎ (4 F)
Cladograms‎ (4 C, 153 F)

F

Fenwick trees‎ (2 F)

K

K-d trees‎ (13 F)

R

Red-black trees‎ (186 F)
Rope (data structure)‎ (9 F)

S

Binary search trees‎ (1 C, 46 F)
Skew heap‎ (7 F)
Splay trees‎ (11 F)

T

Tango trees‎ (12 F)
Treap‎ (10 F)
Tree rotation‎ (10 F)

📚

Studies of Euler diagrams; formula trees‎ (2 C, 4 F)

"Binary trees" 분류에 속하는 미디어

다음은 이 분류에 속하는 파일 331개 가운데 200개입니다.

(이전 페이지) (다음 페이지)

1-dimensional-range-tree.svg 604 × 142; 31 KB
2 Reference Tree after first search for element 17.JPG 982 × 796; 48 KB
4 Reference Tree after performing searches for 17,7,1,18,23,31,27,13,9.JPG 981 × 791; 54 KB
5 reference tree p with preferred paths marked in red after performing all warm-up searches for elements 17,7,1,18,23,31,27,13,9,20 searches.JPG 981 × 799; 54 KB
AA Tree Shape Cases.svg 105 × 70; 2 KB
AA Tree Skew2.svg 280 × 120; 5 KB
AA Tree Split2.svg 255 × 150; 5 KB
ABBEJEM.svg 328 × 152; 837 바이트
ABBHOJA3.svg 615 × 152; 1 KB
ABBHOJA4.svg 615 × 152; 1 KB
ABBHOJA5.svg 615 × 152; 980 바이트
Adjacency list 1.svg 298 × 485; 19 KB
Adjacency list 2.svg 288 × 485; 17 KB
Albero-di-ricerca-binario.png 534 × 191; 5 KB
AlgoRayroleArbre.svg 217 × 142; 3 KB
AlgoRayroleResa.svg 217 × 142; 3 KB
Alibehrouz.gif 300 × 169; 27 KB
Alternating Permutation qtl1.svg 425 × 709; 27 KB
An Example of A Tango Tree.jpg 689 × 566; 52 KB
An example of infinite tree structure.png 1,067 × 449; 30 KB
Animated Binary Tree Rotation.gif 521 × 469; 82 KB
Arbol Exploracion Binario.svg 673 × 446; 3 KB
ArbolCompleto.jpg 519 × 277; 13 KB
Arboles binarios con raices distintas.png 1,024 × 717; 133 KB
Arbolfibo.png 471 × 329; 25 KB
ArbolFIFO.JPG 890 × 314; 29 KB
ArbolNOCompleto 1.jpg 519 × 273; 14 KB
ArbolNOCompleto 2.jpg 515 × 273; 14 KB
Arbre binaire 1.svg 656 × 505; 26 KB
Arbre binaire 2a.svg 656 × 506; 35 KB
Arbre binaire 2b.svg 656 × 505; 35 KB
Arbre binaire 2c.svg 657 × 506; 35 KB
Arbre binaire 3a.svg 877 × 505; 36 KB
Arbre binaire 3b.svg 656 × 505; 33 KB
Arbre binaire 4.svg 842 × 505; 43 KB
Arbre binaire 5.svg 877 × 505; 62 KB
Arbre binaire bravo.png 647 × 317; 13 KB
Arbre binaire exploration.svg 456 × 243; 29 KB
Arbre binaire loi binomiale.svg 166 × 80; 55 KB
Arbre binaire ordonne.svg 408 × 281; 15 KB
Arbre binaire.svg 175 × 254; 4 KB
Arbre bouc-émissaire rééquilibré.png 640 × 400; 21 KB
Arbre bouc-émissaire.png 640 × 400; 19 KB
Arbre-genealogie-vierge 1.svg 2,066 × 2,924; 7 KB
ArbreCousuInfixe.svg 1,052 × 744; 15 KB
ArbreCousuPostfixe.png 160 × 80; 650 바이트
ArbreCousuPrefixe.png 160 × 80; 635 바이트
Arbres wiki droit.svg 146 × 151; 498 바이트
Arbres wiki gauche.svg 146 × 151; 499 바이트
Arbres wiki.svg 430 × 270; 1 KB
Arvore formula logica.JPG 240 × 191; 9 KB
AST binary tree arith variables.svg 333 × 265; 3 KB
AST binary tree arithmetic.svg 333 × 265; 4 KB
Asymmetric tree.svg 220 × 170; 689 바이트
Attraversamento albero binario.png 278 × 238; 3 KB
B1t2.jpg 285 × 183; 5 KB
Balancierter Binärbaum.jpg 934 × 222; 102 KB
Balancierter Binärbaum2.jpg 957 × 222; 102 KB
Baum1.png 1,723 × 890; 15 KB
Baum2.png 1,330 × 1,283; 18 KB
BijectionCatalan.png 4,388 × 2,265; 245 KB
Bin-tree.svg 802 × 576; 14 KB
Bin-tree-repres.svg 623 × 344; 14 KB
BinaireBoom.png 761 × 362; 7 KB
Binary Algebraic Expression Tree.JPG 488 × 362; 14 KB
Binary Idea Merge 2.png 256 × 200; 9 KB
Binary Ideal Merge 1.png 256 × 200; 9 KB
Binary Ideal Merge 2.png 256 × 200; 9 KB
Binary math expression tree.svg 180 × 200; 9 KB
Binary tree (letters).png 232 × 204; 13 KB
Binary tree (oriented digraph).png 260 × 229; 4 KB
Binary tree - stack.png 633 × 533; 20 KB
Binary tree and corresponding triangulation.pdf 437 × 235; 7 KB
Binary tree array.svg 520 × 224; 51 KB
Binary tree as array.svg 510 × 161; 63 KB
Binary tree fills.svg 300 × 250; 18 KB
Binary tree in array.svg 370 × 93; 9 KB
Binary tree parent pointers.svg 600 × 660; 20 KB
Binary Tree Rotation (animated).gif 521 × 466; 258 KB
Binary tree simplified.svg 512 × 333; 1 KB
Binary tree sort(1).png 581 × 798; 39 KB
Binary tree sort(2).png 584 × 894; 42 KB
Binary tree structure.svg 500 × 300; 10 KB
Binary tree traversion.svg 334 × 290; 28 KB
Binary tree v2.svg 783 × 833; 10 KB
Binary tree.png 1,305 × 758; 9 KB
Binary Tree.png 686 × 311; 11 KB
Binary tree.svg 300 × 250; 17 KB
Binary words as binary tree.svg 666 × 440; 148 KB
Binary-tree-example.png 543 × 316; 6 KB
Binary-tree-example2.PNG 271 × 158; 2 KB
Binary-tree-example3.PNG 348 × 265; 4 KB
Binary-tree-Knuth.svg 1,092 × 838; 84 KB
Binary-tree-structure.png 282 × 222; 1 KB
Binary-tree.svg 1,077 × 713; 59 KB
BinaryTree leaf.jpg 325 × 279; 12 KB
Binärbaum Beispiel 2.jpg 1,482 × 804; 67 KB
BinärBaum Beschriftung.jpg 2,033 × 1,082; 306 KB
BinärBaum Einfügen.jpg 1,315 × 1,036; 253 KB
BinärBaum Niveau.jpg 2,427 × 1,370; 402 KB
BinärBaum Pseudoknoten.jpg 1,311 × 1,355; 255 KB
BinärBaum Suchbaum.jpg 1,347 × 1,273; 326 KB
BinärBaum Term.jpg 1,816 × 1,359; 305 KB
BinärBaum Term.svg 1,053 × 745; 16 KB
Binärt sökträd med strängarna må ti och on insatta.png 374 × 136; 5 KB
Binärt sökträd med strängarna må ti on och to insatta.png 445 × 222; 10 KB
Binärt sökträd med strängarna må ti on to fr lo och sö insatta.png 562 × 222; 13 KB
Binärt sökträd med strängarna må ti on to fr och lo insatta.png 562 × 222; 14 KB
Binärt sökträd med strängarna må ti on to och fr insatta.png 562 × 222; 13 KB
Binärt sökträd med strängen må insatt.png 289 × 83; 3 KB
Binärt sökträd med stängarna må och ti insatta.png 374 × 136; 5 KB
Bitree.JPG 155 × 161; 11 KB
Boretti Arbre niveau.png 437 × 210; 11 KB
Bt1.jpg 415 × 394; 13 KB
Bt3.jpg 369 × 269; 8 KB
Bt4.jpg 463 × 265; 14 KB
Bt5.jpg 463 × 260; 14 KB
Bt6.jpg 537 × 400; 16 KB
Bt7.jpg 714 × 446; 20 KB
Btree1.jpg 800 × 600; 190 KB
CalkinWilf.svg 250 × 215; 8 KB
Calkin–Wilf tree.svg 247 × 156; 14 KB
Cantor set binary tree.svg 735 × 351; 70 KB
Cassidy.1985.015.gif 1,087 × 357; 136 KB
Catalan bijection tree SL.png 1,150 × 700; 31 KB
Classic-stream-order.png 1,347 × 619; 40 KB
Classic-stream-order.svg 1,347 × 619; 2 KB
Coalescent tree.png 123 × 137; 2 KB
Cograph cotree.png 570 × 274; 27 KB
Compatibilité 3ia.JPG 885 × 641; 50 KB
Full binary.svg 800 × 598; 8 KB
Complete anytime tree.png 1,335 × 667; 43 KB
Complete binary.svg 800 × 471; 13 KB
Complete binary2.svg 900 × 470; 626 바이트
Cotree and cograph.svg 702 × 270; 3 KB
CPT BinaryTree CityEx1.svg 403 × 317; 13 KB
CPT BinaryTree LettersEx1.svg 365 × 258; 11 KB
CPT BinaryTree NumberEx1.svg 365 × 258; 12 KB
CPT BinaryTree NumberEx2(unordered).svg 325 × 258; 11 KB
Decision tree model.png 573 × 404; 76 KB
Diagram01.jpg 631 × 761; 61 KB
Diagram02.jpg 604 × 372; 37 KB
Diagram06.jpg 1,000 × 380; 60 KB
Diagram09.jpg 1,119 × 591; 76 KB
Diagram10.jpg 972 × 464; 83 KB
Diagram11.jpg 522 × 581; 37 KB
Diagram12.jpg 836 × 310; 34 KB
Diagram13.jpg 750 × 266; 32 KB
Diagram14.jpg 522 × 581; 38 KB
Diagram14.png 785 × 108; 17 KB
Diagram15.jpg 697 × 230; 34 KB
Diagram16.jpg 1,119 × 591; 76 KB
Diameter-of-Binary-Tree (1).png 1,337 × 640; 64 KB
Diameter-of-Binary-Tree.png 1,337 × 640; 53 KB
Dir tree.png 343 × 176; 12 KB
Double -exponential search on X-fast tries.png 641 × 532; 18 KB
Dsa binary search tree.svg 512 × 302; 2 KB
DSW Rotate left.png 400 × 200; 22 KB
Dynamical plane with branched periodic external ray 0 for map f(z) = z*z + 0.35.png 1,000 × 1,000; 47 KB
Dynamical plane with branched periodic external ray 0 for map f(z) = z*z + 0.35.svg 1,000 × 1,000; 8.51 MB
EstratLIFO.JPG 761 × 428; 30 KB
Ex 001.png 720 × 720; 4 KB
Example Heap.png 126 × 87; 755 바이트
Expande.gif 659 × 204; 20 KB
Extended binary tree.svg 594 × 540; 1 KB
Extensive form game 1.JPG 663 × 619; 27 KB
Fig150.png 1,011 × 614; 15 KB
Fig16.PNG 1,011 × 637; 20 KB
FinishGraph.jpg 637 × 488; 51 KB
FirstStepGraph.jpg 1,255 × 856; 104 KB
FullBT CompleteBT.jpg 542 × 279; 20 KB
GP crossover.png 1,660 × 1,391; 123 KB
GP tree1.png 694 × 392; 19 KB
Grigorchuk group generators.svg 2,789 × 1,216; 118 KB
Hashtree3.jpg 545 × 298; 23 KB
HBLT 1.jpg 876 × 565; 29 KB
HBLT 2.jpg 876 × 565; 32 KB
HBLT 3.jpg 876 × 565; 35 KB
HBLT 4.jpg 876 × 565; 38 KB
HBLT 5.jpg 876 × 565; 36 KB
HBLT 6.jpg 876 × 565; 33 KB
HBLT 8.jpg 876 × 565; 30 KB
HBLT 9.jpg 876 × 565; 22 KB
HBLT 9.png 876 × 565; 26 KB
HBLT vs WBLT.png 761 × 565; 22 KB
Height Balanced Binary Tree.pdf 1,275 × 1,650, 22쪽; 105 KB
Hloubka vyska.jpg 400 × 400; 27 KB
Id3 result.gif 444 × 414; 5 KB
Iimj 5.png 1,000 × 1,000; 10 KB
Implementation Tango Cut using RedBlack Split.jpg 788 × 525; 103 KB
Insert-delete-ziptree.jpg 2,066 × 1,211; 393 KB
Insertar.svg 1,655 × 458; 42 KB
Insättning av må till sö i binärt sökträd miniatyr.png 720 × 460; 34 KB
Insättning av må till sö i binärt sökträd.png 1,441 × 921; 77 KB
Kahendpuu.png 420 × 314; 10 KB
Kingman coalescent.png 408 × 383; 4 KB
Konstruktion Baum.jpg 322 × 171; 55 KB
Leaf-objects.svg 250 × 300; 14 KB
Leftist-trees-S-value.svg 210 × 131; 13 KB
Leftsubtree.png 133 × 150; 1,016 바이트

(이전 페이지) (다음 페이지)

원본 주소 "https://commons.wikimedia.org/w/index.php?title=Category:Binary_trees&oldid=527666558"

카테고리들:

숨은 분류:

Uses of Wikidata Infobox