problem or jumper
In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given distance from the root of the tree.
More precisely, let T be a rooted tree with n nodes, and let v be an arbitrary node of T. The level ancestor query LA(v,d) requests the ancestor of node v at depth d, where the depth of a node v in a tree is the number of edges on the shortest path from the root of the tree to node v.
It is possible to solve this problem in constant time per query, after a preprocessing algorithm that takes O
and that builds a data structure that uses O storage space.
View More On Wikipedia.org
More precisely, let T be a rooted tree with n nodes, and let v be an arbitrary node of T. The level ancestor query LA(v,d) requests the ancestor of node v at depth d, where the depth of a node v in a tree is the number of edges on the shortest path from the root of the tree to node v.
It is possible to solve this problem in constant time per query, after a preprocessing algorithm that takes O
and that builds a data structure that uses O storage space.View More On Wikipedia.org