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.
| < Previous Terms | Terms Containing binary tree | Next Terms > |
| binary file binary large object binary package binary search Binary Synchronous Transmission | balanced tree B-tree cdr cons fencepost error | BIND bindery binding handle binding-time analysis BinHex |
