binary-tree representation

Quick Reference

1 A binary tree constructed to represent a tree of arbitrary degree. For any node, the root of the left subtree in the binary-tree representation is the eldest child of the node in the original tree and the root of the right subtree is the next eldest sibling.

2 See binary tree (def. 2).

Subjects: Computing.

Reference entries