TY - JOUR
T1 - A dichromatic framework for balanced trees
AU - Guibas, Leo J.
AU - Sedgewick, Robert
N1 - Funding Information:
This work was done in part while this author was a Visiting Scientist at the Xerox Palo Alto Research Center and in part under support from thc NatiGfna1 Sciencc Foundation, grant no. MCS75-23738.
Funding Information:
This work was done in part while this author was a Visiting Scientist at the Xerox Palo Alto Research Center and in part under support from thc National Sciencc Foundation, grant no. MCS75-23738.
Publisher Copyright:
© 1973 IEEE.
PY - 1978
Y1 - 1978
N2 - In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imhcd in this framework the best known balanced tree techniques and then use the framework to develop new which perform the update and rebalancing in one pass, Oil the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.
AB - In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imhcd in this framework the best known balanced tree techniques and then use the framework to develop new which perform the update and rebalancing in one pass, Oil the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.
UR - http://www.scopus.com/inward/record.url?scp=85039153497&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85039153497&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1978.3
DO - 10.1109/sfcs.1978.3
M3 - Conference article
AN - SCOPUS:85039153497
SN - 0272-5428
VL - 1978-October
SP - 8
EP - 21
JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
T2 - 19th Annual Symposium on Foundations of Computer Science, SFCS 1978
Y2 - 16 October 1978 through 18 October 1978
ER -