Definition: A variant of a threaded tree in which only the right thread, i.e. link to the successor, of each node is maintained.
Generalization (I am a kind of ...)
See also binary search tree.
Note: Keeping only the right thread, rather than both left and right threads, keeps it quick to find the next greater key and faster to insert and delete.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 November 2019.
HTML page formatted Tue Nov 12 10:04:35 2019.
Cite this as:
Paul E. Black, "right-threaded tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 November 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/rightThreadedTree.html