bn:03178845n
Noun Concept
Categories: Binary trees, All articles needing additional references, All articles needing rewrite
EN
binary tree  bifurcating arborescence  binary trees  complete binary tree  Deletion in binary tree
EN
In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. Wikipedia
English:
data structure
graph theory
Definitions
Relations
Sources
EN
In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. Wikipedia
A computer tree data structure in which each node has at most two children Wikipedia Disambiguation
Tree data structure in which each node has at most two children Wikidata
A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles. Wiktionary
A data structure. Wiktionary (translation)