binary tree

(redirected from Extended binary tree)

binary tree

[′bīn·ə·rē ′trē]
(mathematics)
A rooted tree in which each vertex has a maximum of two successors.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

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.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

binary tree

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


Binary Tree
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
These trees are defined by the equation C = 1 + zC + Z[C.sup.2]; they can be obtained from extended binary trees given by B = y + z[B.sup.2] (z marking internal nodes, y marking leaves) by the substitutions

Full browser ?