bn:02890405n
Noun Concept
IT
No term available
EN
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. Wikipedia
Relations
Sources