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.
CITATION STYLE
Bender, M. A., & Farach-Colton, M. (2002). The level Ancestor problem simplified. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2286, pp. 508–515). Springer Verlag. https://doi.org/10.1007/3-540-45995-2_44
Mendeley helps you to discover research relevant for your work.