ConceptTheory & Algos
Euler-tour trees
Simpler dynamic trees compared to link-cut trees that allow operations on subtrees instead of paths.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
9The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Balanced binary search tree
- Dynamic connectivity
- Euler tour
- Link-cut trees
- Cut operation
- Decremental connectivity