Rebalancing operations for deletions in AVL-trees
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1985)
- Volume: 19, Issue: 4, page 323-329
- ISSN: 0988-3754
Access Full Article
top
How to cite
topTsakalidis, Athanasios K.. "Rebalancing operations for deletions in AVL-trees." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.4 (1985): 323-329. <http://eudml.org/doc/92236>.
@article{Tsakalidis1985,
author = {Tsakalidis, Athanasios K.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {balanced trees; data structures; total rebalancing time; structure changes},
language = {eng},
number = {4},
pages = {323-329},
publisher = {EDP-Sciences},
title = {Rebalancing operations for deletions in AVL-trees},
url = {http://eudml.org/doc/92236},
volume = {19},
year = {1985},
}
TY - JOUR
AU - Tsakalidis, Athanasios K.
TI - Rebalancing operations for deletions in AVL-trees
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 4
SP - 323
EP - 329
LA - eng
KW - balanced trees; data structures; total rebalancing time; structure changes
UR - http://eudml.org/doc/92236
ER -
References
top- 1. G. M. ADEL'SON-VEL'SKII and E. M. LANDIS, An Algorithm for the Organization of Information, Dokl. Akad. Nauk S.S.S.R., Vol. 146, 1962, pp. 263-266 (in Russian); English Translation in Soviet. Math., Vol. 3, pp. 1259-1262. MR156719
- 2. M. R. BROWN, A Partial Analysis of Random Height-Balanced Trees, S.I.A.M. J. Comput., Vol. 8, 1979, pp. 33-41. Zbl0402.05024MR522968
- 3. C. C. FOSTER, Information Storage and Retrieval Using AVL-Trees, ACM 20th National Conference, 1965, pp. 192-205.
- 4. P. L. KARLTON, S. H. FULLER, R. E. SCROGGS and E. B. KAEHLER, Performance of Height-Balanced Trees, Comm. ACM., Vol. 19, 1976, pp. 23-28. Zbl0317.68044
- 5. D. E. KNUTH, The Art of Computer Programming, Sorting and Searching, Vol. 3, Addison-Wesley, Reading, MA, 1973. Zbl0302.68010MR378456
- 6. K. MEHLHORN, A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions, S.I.A.M. J. Comput., Vol. 11, 1982, pp. 748-760. Zbl0496.68029MR677665
- 7. K. MEHLHORN, Data Structures and Algorithms 1, 2, 3, Springer Verlag, E.A.T.C.S. Monographs in Theoretical Computer Science, 1984. Zbl0556.68002MR756413
- 8. K. MEHLHORN and A. K. TSAKALIDIS, An Amortized Analysis of Insertions into AVL-Trees, S.I.A.M. J. Comput. (in press). Zbl0589.68048
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.