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 Wed Oct 30 12:15:30 2024.

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