binary tree

In computer science, a binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are called left and right. One common use of binary trees is binary search trees; another is binary heaps.
See more at Wikipedia.org...

(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.
(1994-11-29)

B: (Matematika) pohon biner
Built to Babylon by Hikmat Gumilar Visit my Website;