2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1978)
Oct. 16, 1978 to Oct. 18, 1978
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.3
In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.
Robert Sedgewick, Leo J. Guibas, "A dichromatic framework for balanced trees", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 8-21, 1978, doi:10.1109/SFCS.1978.3