binary tree

binary tree

[′bīn·ə·rē ′trē] (mathematics) A rooted tree in which each vertex has a maximum of two successors.

binary tree

(btree) A tree in which each node has at most two successorsor child nodes. In Haskell this could be represented as

data BTree a = NilTree| Node a (BTree a) (BTree a)

See also balanced tree.

binary tree

A data structure in which each node contains one parent and no more than two children. See quad tree and splay tree.

Binary Tree