Data structureresearch
LOUDS trie
Also called level-order unary degree sequence.
Succinct trie encoding the tree shape in breadth-first order as a bit string with rank and select.
Succinct trie encoding the tree shape in breadth-first order as a bit string with rank and select.
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 C20ZQR Edit this page History Report an error