Abstract
We analyse the average behavior of the insertion scheme for 1–2 brother trees by modifying it in such a way that Yao's technique becomes applicable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. R. Brown,A partial analysis of random height-balanced trees, SIAM J. Comp. 8 (1979), 33–41.
K. Culik II, Th. Ottmann, and D. Wood,Dense multiway trees, Report 77, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, (1978).
D. Knuth,The Art of Computer Programming, Vol. 3:Sorting and Searching, Addison-Wesley, Reading, Mass., (1979).
H.-P. Kriegel, V. K. Vaisnavi and D. Wood, 2–3brother trees, BIT 18 (1978), 425–435.
H. A. Larson and W. E. Walden,Comparing insertion schemes used to update 3–2trees, Technical Report, Computing and Information Science Department, University of New Mexico, Albuquerque, NM 87–131 (1979).
K. Mehlhorn,A partial analysis of height-balanced trees, Bericht A79/13 Fachbereich 10, Universität des Saarlandes, (June 1979).
K. Mehlhorn,A partial analysis of height-balanced trees under random insertions and deletions, Bericht A79/12, Fachbereich 10, Universität des Saarlandes, (October 1979).
Th. Ottmann, and W. Stucky,Higher order analysis of random 1–2brother trees, Report 84, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, (1979).
Th. Ottmann, and D. Wood, 1–2brother trees or AVL trees revisited, The Computer Journal vol. 23 (3), (1980), 248–255.
A. Yao,On random 2,3trees, Acta Informatica 9 (1978), 159–170.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ottmann, T., Stucky, W. Higher order analysis of random 1–2 brother trees. BIT 20, 302–314 (1980). https://doi.org/10.1007/BF01932772
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932772