(data structure)
Definition: A binary search tree in which each node uses an otherwise-empty left child link to refer to the node's in-order predecessor and an empty right child link to refer to its in-order successor.
See also right-threaded tree, binary search tree.
Note: See [Knuth97, 1:320, Sect. 2.3.1]. Although the definition could refer to a multiway tree, Knuth defines a threaded tree as a binary tree.
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:23 2009.
Cite this as:
Paul E. Black, "threaded 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/threadedtree.html
