binary tree

Computing Dictionary

binary tree definition


(btree) A tree in which each node has at most two successors or child nodes. In Haskell this could be represented as
data BTree a = NilTree | Node a (BTree a) (BTree a)
See also balanced tree.
(1994-11-29)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: binary system
Next Definition: binary weapon
Words Near: binary tree
More from Thesaurus.com
Synonyms and Antonyms for binary tree
More from Reference.com
Search for articles containing binary tree
More from Dictionary.com Translator
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature