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

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ ba ] [ balanced tree ] [ be ] [ bt ] [ cc ] [ ch ] [ child ] [ co ] [ data ] [ de ] [ du ] [ ed ] [ ee ] [ er ] [ es ] [ fi ] [ file ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ is ] [ ke ] [ la ] [ ld ] [ Lex ] [ ls ] [ mo ] [ mod ] [ module ] [ N ] [ na ] [ nc ] [ no ] [ node ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ sk ] [ so ] [ st ] [ su ] [ successor ] [ T ] [ th ] [ tr ] [ tree ] [ tw ]