Data structureadvanced
Virtual tree
A compressed tree built on a chosen set of key vertices and their pairwise lowest common ancestors, so queries touch only O(k) nodes.
A compressed tree built on a chosen set of key vertices and their pairwise lowest common ancestors, so queries touch only O(k) nodes.
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 Q53SNA Edit this page History Report an error