binary tree


Get Babylon's Translation Software! Free Download Now!

Wikipedia English The Free EncyclopediaDownload this dictionary

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...

This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License


FOLDOC DictionaryDownload this dictionary
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.
(1994-11-29)


(c) Copyright 1993 by Denis Howe

Define binary tree

Translate binary tree




binary tree in Chinese | | binary tree in French | binary tree in Spanish | binary tree in Dutch | binary tree in German | binary tree in Russian | binary tree in Japanese | binary tree in Korean | binary tree in Turkish | binary tree in Hebrew | binary tree in Arabic | binary tree in Croatian | binary tree in Serbian