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)

Nearby terms:
binary package « binary search « Binary Synchronous Transmission « binary tree » BIND » bindery » binding handle