The DICT Development Group

Search for:
Search type:

Database copyright information
Server information

1 definition found
 for binary tree
From The Free On-line Dictionary of Computing (30 December 2018) :

  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.

Contact=webmaster@dict.org Specification=RFC 2229