binary tree

(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.

Last updated: 1994-11-29

Try this search on Wikipedia, OneLook, Google

Nearby terms:

binary prefix « binary search « Binary Synchronous Transmission « binary tree » BIND » bindery » binding handle

Loading