Definition: A binary search tree that needs no balance information. Search time is logarithmic, and the amortized cost of update is logarithmic.
Note: I. Galperin and R. L. Rivest, Scapegoat trees, Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1993, pages 165-174.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 24 May 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "scapegoat tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 24 May 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/scapegoatTree.html