binary tree

(redirected from Complete binary tree)
Also found in: Acronyms.

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.

binary tree

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


Binary Tree
References in periodicals archive ?
The length of the binary tree c with the right path, so that c is the Huffman number, and shows that the minimum weighted path length of the tree is not necessarily a complete binary tree.
They used this interpretation to relate the Tanny sequence with the so called discrete connected isoperimetric problem on infinite complete binary trees.
The broadcaster associates an m bit label for each vertex i in the complete binary tree.
These have similar properties to the deterministic complete binary tree with height [[log.
n] the number of complete binary trees with n internal vertices.

Full browser ?