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