dictionary help| binary tree | computing dictionary |
(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.
(01 Mar 1994)
binary process, binary search, Binary Synchronous Transmission < Prev | Next > binasal hemianopia, binate, binaural
Bookmark with:      | word visualiser | Go and visit our forums  |
