binary tree
A data structure in which each node contains one parent and no more than two children. |
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 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. |
Want to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit the webmaster's page for free fun content.
| ?Page tools | ||
|---|---|---|
|