Advertisement

Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen

  • Norbert Blum
  • Kurt Mehlhorn
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Kurzfassung

Es wird gezeigt, daß die mittlere Anzahl von Balancierungs-operationen (Rotationen und Doppelrotationen) bei gewichtsbalancierten Bäumen konstant ist.

Keywords

Dann Gilt Height Balance Tree Wenn Gilt 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [AHU]
    Aho, Hopcroft, Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley, 1974Google Scholar
  2. [AVL]
    Adel'son-Velskii, Laudis: An algorithm for the organization of information, Soviet. Math. Dokl, 3, 1259–1262, 1962Google Scholar
  3. [BM]
    Blum N., Mehlhorn, K.: On the average number of rebalancing operations in weight-balanced trees, Technischer Bericht A-78/06, FB 10 der Universität des Saarlandes, 1978Google Scholar
  4. [BS]
    Bayer, Schkolnik: Concurrency of Operations on B-Trees, Acta Informatica, Vol. 9, Fasc. 1, 1977, S. 1–22CrossRefGoogle Scholar
  5. [F]
    Foster: Information Storage and Retrieval using AVL-trees, Proc. ACM Nat. Conf. 20, 192–205, 1965Google Scholar
  6. [KFSK]
    Karlton, Fuller, Scroggs, Kaehler: Performance of Height Balanced Trees, ACM, Jan. 1976, Vol. 19/1, S. 23–28Google Scholar
  7. [M]
    Mehlhorn, K.: Effiziente Algorithmen, Teubner Verlag, Studienbücher Informatik, 1977Google Scholar
  8. [NR]
    Nievergelt, Reingold: Binary Search Trees of Bounded Balance, SIAM, J. Comput., Vol. 2, No. 1, March 1973Google Scholar
  9. [OS]
    Ottman, Six: Eine neue Klasse von ausgeglichenen Bäumen, Angewandte Informatik, Heft 9, S. 395–400, 1976Google Scholar
  10. [Y]
    Yao: On Random 2–3 Trees, Acta Informatica, Vol. 9, Fasc. 2, 1978, S. 159–170CrossRefGoogle Scholar
  11. [KN]
    Knuth: The Art of Computer Programming, Vol. III: Sorting and Searching, Addison Wesley Publishing CompanyGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Norbert Blum
  • Kurt Mehlhorn

There are no affiliations available

Personalised recommendations