(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 20 November 2008.
HTML page formatted Wed Feb 4 11:02:21 2009.
Cite this as:
Paul E. Black, "extended binary tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 20 November 2008. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/extendedBinaryTree.html
