Techniquecore
Binary lifting
Also called jump pointers, doubling on trees.
Precompute 2^k-th ancestors so any ancestor is reached in O(log n) jumps.
Precompute 2^k-th ancestors so any ancestor is reached in O(log n) jumps.
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 BSW47R Edit this page History Report an error