Problemcore
Path queries on trees
Problem of answering queries about the path between two tree nodes, using techniques such as lowest common ancestor and Euler tours.
Problem of answering queries about the path between two tree nodes, using techniques such as lowest common ancestor and Euler tours.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 92RHMV Edit this page History Report an error