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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 23 May 2011.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "threaded tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 23 May 2011. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/threadedtree.html