Try Our Apps


Supposedly vs. Supposably

binary tree

binary tree in Technology

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

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source

Word of the Day

Word Value for binary

Scrabble Words With Friends