Theoremcore
Suffix tree size theorem
Also called linear size of suffix trees.
A suffix tree of an n-character string has at most n leaves and at most 2n nodes.
A suffix tree of an n-character string has at most n leaves and at most 2n 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 S54V4V Edit this page History Report an error