Skip to main content
SpringerLink
Log in

The Level Ancestor Problem Simplified

  • Conference paper
  • First Online:
LATIN 2002: Theoretical Informatics (LATIN 2002)

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

Included in the following conference series:

Abstract

We present a very simple algorithm for the Level Ancestor Problem. A Level Ancestor Query LA(v, d) requests the depth d ancestor of node v. The Level Ancestor Problem is thus: preprocess a given rooted tree T to answer level ancestor queries. While optimal solutions to this problem already exist, our new optimal solution is simple enough to be taught and implemented.

Partially supported by NSF CCR 9820879.

In fact, 22 28

Previously a wrong PDF was attached to the online version of this chapter. This has now been corrected.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. S. Alstrup and J. Holm. Improved algorithms for finding level-ancestors in dynamic trees. In 27th International Colloquium on Automata, Languages and Programming (ICALP’ 00), LNCS. 1853, pages 73–84, 2000.

    MATH  Google Scholar 

  2. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399–409, 2000.

    Google Scholar 

  3. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In LATIN, pages 88–94, 2000.

    Google Scholar 

  4. O. Berkman and U. Vishkin. Recursive *-tree parallel data-structure. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 196–202, 1989.

    Google Scholar 

  5. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. Comput., 22(2):221–242, Apr. 1993.

    Article  MathSciNet  Google Scholar 

  6. O. Berkman and U. Vishkin. Finding level-ancestors in trees. J. Comput. Syst. Sci., 48(2):214–230, Apr. 1994.

    Article  MathSciNet  Google Scholar 

  7. R. Cole and R. Hariharan. Dynamic LCA queries on trees. In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 235–244, 1999.

    Google Scholar 

  8. P. F. Dietz. Finding level-ancestors in dynamic trees. In Workshop on Algorithms and Data Structures, pages 32–40, 1991.

    Google Scholar 

  9. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. of the 16th Ann. ACM Symp. on Theory of Computing, pages 135–143, 1984.

    Google Scholar 

  10. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2):338–355, 1984.

    Article  MathSciNet  Google Scholar 

  11. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput., 17:1253–1262, 1988.

    Article  MathSciNet  Google Scholar 

  12. R. E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690–715, Oct. 1979.

    Article  MathSciNet  Google Scholar 

  13. B. Wang, J. Tsai, and Y. Chuang. The lowest common ancestor problem on a tree with unfixed root. Information Sciences, 119:125–130, 1999.

    Article  MathSciNet  Google Scholar 

  14. Z. Wen. New algorithms for the LCA problem and the binary tree reconstruction problem. Inf. Process. Lett., 51(1):11–16, 1994.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Stony Brook, 11794-4400, Stony Brook, NY, USA

    Michael A. Bender

  2. Google Inc, 2400 Bayshore Parkway, Mountain View, 94043, California, USA

    Martín Farach-Colton

  3. Department of Computer Science, Rutgers University, USA

    Martín Farach-Colton

Authors
  1. Michael A. Bender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martín Farach-Colton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Compaq Cambridge Research Laboratory, One Cambridge Center, 02142-1612, Cambridge, MA, USA

    Sergio Rajsbaum

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bender, M.A., Farach-Colton, M. (2002). The Level Ancestor Problem Simplified. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-45995-2_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43400-9

  • Online ISBN: 978-3-540-45995-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation