Binary tree

related topics
{math, number, function}
{woman, child, man}
{specie, animal, plant}
{@card@, make, design}
{car, race, vehicle}

In computer science, a binary tree 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. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child.

Binary trees are commonly used to implement binary search trees and binary heaps.

Contents

Full article ▸

related documents
Hausdorff space
Additive category
Spectral theorem
Bubble sort
Binary heap
Planar graph
Polymorphism in object-oriented programming
Self-organizing map
Transcendental number
Universal property
Linear map
Inequality
Partial derivative
Euler–Mascheroni constant
Horner scheme
Total order
Axiom schema of specification
Analytic continuation
NP-complete
Splay tree
Projective plane
Convergence of random variables
Octonion
Preadditive category
Embedding
Array
Field extension
Burnside's problem
Orthogonality
Uniform convergence