Skip to main content

On the Stack Size of a Class of Backtrack Trees

  • Chapter
Informatik

Part of the book series: TEUBNER-TEXTE zur Informatik ((TTZI,volume 1))

Abstract

We derive a lower and an upper bound for the average stack size of a tree contained in a family F p (h) of non-regularly distributed binary trees introduced by P.W.Purdom for the purpose of modelling backtrack trees. The considered trees have a height less than or equal to h and their shapes are controlled by an external parameter p ∈ [0,1].

We show that the average stack size of a tree appearing in F p (h) is bounded by a constant for 0 ≤ p < ½, and that it grows at most logarithmically in h if p = ½; for ½ < p ≤ 1, the average stack size grows linearly in h.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Kemp, R.: A note on the stack size of regularly distributed binary trees, BIT 20 (1980), 157–163.

    Article  MathSciNet  MATH  Google Scholar 

  2. Kemp, R.: On the average oscillation of a stack, COMBINATORICA 2(2) (1982), 157–176.

    Article  MathSciNet  MATH  Google Scholar 

  3. Kemp, R.: The expected additive weight of trees, Acta Informatica 26 (1989), 711–740.

    Article  MathSciNet  MATH  Google Scholar 

  4. Kemp, R.: The analysis of a special class of backtrack trees, preprint Johann Wolfgang Goethe-Universität Frankfurt a.M., 1991.

    Google Scholar 

  5. Knuth, D.E.: The Art of Computer Programming, Vol. 1, 2nd ed. Addison-Wesley, Reading, Mass. 1973.

    Google Scholar 

  6. Meir, A., Moon, J.W.: On the altitude of nodes in random trees, Can. J, Math . 30 (1978), 997–1015.

    Article  MathSciNet  MATH  Google Scholar 

  7. Purdom, P.W.: Tree size by partial backtracking, SIAM J. Comput. 4(4) (1978), 481–491.

    Article  MathSciNet  Google Scholar 

  8. Trier, U.: Additive weights of a special class of nonuniformly distributed backtrack trees, preprint Johann Wolfgang Goethe-Universität Frankfurt a.M., 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 B. G. Teubner Verlagsgesellschaft, Leipzig

About this chapter

Cite this chapter

Kemp, R. (1992). On the Stack Size of a Class of Backtrack Trees. In: Buchmann, J., Ganzinger, H., Paul, W.J. (eds) Informatik. TEUBNER-TEXTE zur Informatik, vol 1. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-95233-2_16

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-8154-2033-1

  • Online ISBN: 978-3-322-95233-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics