Problemintro
Tree isomorphism
Also called rooted tree isomorphism, unordered tree isomorphism, unrooted tree isomorphism.
Decide whether two trees are isomorphic; solvable in linear time for rooted and unrooted trees.
Decide whether two trees are isomorphic; solvable in linear time for rooted and unrooted trees.
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 W1HHC1 Edit this page History Report an error