NIST

extended binary tree

(data structure)

Definition: A binary tree with special nodes replacing every null subtree. Every regular node has two children, and every special node has no children.

Note: After [Knuth97, 1:399, Sect. 2.3.4.5].

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 20 November 2008.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "extended binary tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 20 November 2008. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/extendedBinaryTree.html