Skip to main content
SpringerLink
Log in

Monotonically labelled ordered trees and multidimensional binary trees

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 710))

Included in the following conference series:

Abstract

The classical one-to-one correspondence between (unlabelled) ordered trees with n nodes and (unlabelled) extended binary trees with (2n−1) nodes is generalized to monotonically labelled ordered trees and multidimensional extended binary trees.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.G. De Bruijn, B.J.M. Morselt: A note on plane trees. J. Combin. Theory 2, 27–34 (1967)

    Google Scholar 

  2. Ph. Flajolet, J.C. Raoult, J. Vuillemin: The number of registers required for evaluating arithmetic expressions. Theoret. Comput. Sci. 9, 99–125 (1979)

    Article  Google Scholar 

  3. Ph. Flajolet: Analyse d'Algorithmes de Manipulation d'arbres et de fichiers. Cahiers du BURO 34–35, 1–209 (1981)

    Google Scholar 

  4. J. Françon: Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique. RAIRO Inform. Théor. 18, 355–364 (1984)

    Google Scholar 

  5. F. Harary, G. Prins, W.T. Tutte: The number of plane trees. Indag. Math. 26, 319–239 (1964)

    Google Scholar 

  6. R. Kemp: The average number of registers needed to evaluate a binary tree optimally. Acta Inform. 11, 363–372 (1979)

    Article  Google Scholar 

  7. R. Kemp: The reduction of binary trees by means of an input-restricted deque. RAIRO Inform. Théor. 17, 249–284 (1983)

    Google Scholar 

  8. R. Kemp: A one-to-one correspondence between two classes of ordered trees. Inform. Process. Letters 32, 229–234 (1989)

    Article  Google Scholar 

  9. R. Kemp: Binary search trees for d-dimensional keys. J. Inf. Process. Cybern. EIK 25 (10), 513–527 (1989)

    Google Scholar 

  10. R. Kemp: On the number of deepest nodes in ordered trees. Discrete Math. 81, 247–258 (1990)

    Article  Google Scholar 

  11. R. Kemp: Random multidimensional binary trees. J. Inf. Process. Cybern. EIK 29, 9–36 (1993)

    Google Scholar 

  12. D.E. Knuth: The Art of Computer Programming, Vol. 1, 2nd ed., Addison-Wesley, Reading, MA, (1977)

    Google Scholar 

  13. W. Kuich: Languages and the enumeration of planted plane trees. Koninkl. Nederl. Akademie van Wetenschappen, Proceedings Series A, 73 (4), 268–280 (1970)

    Google Scholar 

  14. H. Prodinger, F.J. Urbanek: On monotone functions of tree stuctures. Discrete Applied Math. 5, 223–239 (1983)

    Article  Google Scholar 

  15. V. Strehl: Two short proofs of Kemp's identity for rooted plane trees. Europ. J. Combin. 5, 373–376 (1984)

    Google Scholar 

  16. S. Zaks: Lexicographic generation of ordered trees. Theoret. Comput. Sci. 10, 63–82 (1980)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Johann Wolfgang Goethe-Universität, D-6000, Frankfurt am Main, Germany

    Rainer Kemp

Authors
  1. Rainer Kemp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kemp, R. (1993). Monotonically labelled ordered trees and multidimensional binary trees. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation