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 ?
In particular, the vertices of the complete binary tree which users are leaves of are partitioned into classes by their distance from the root (i.
In the complete binary tree representation, a given set of privileged users can be partitioned into users in the left subtree and users in the right subtree.
Instead we generalize the proofs in [6] by using similar methods that Janson used for the complete binary tree [8].
n] the number of complete binary trees with n internal vertices.

Full browser ?