Jump to content

Binary tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BlckKnght (talk | contribs) at 09:52, 30 September 2001 (don't link to "tree" which is too generic (use "tree data structure" instead)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A binary tree is a tree data structure with at most two children. Typically the child nodes are called left and right.


See binary search tree