# Uncategorized : Trees

This list is used to train students. Do not use it without supervision.

- Erase Leaves
- It is a tree : Subtask 1

- Count Connected Induced Subgraphs
- Tree node consensus maximum value
- Downward Paths with Only Last Vertex Black
- Paths with Terminal Black Vertices
- Prologue to Count Paths

- Vlad and Trouble at MIT
- Paths with at most 2 Black Vertices
- Spanning Subgraphs with Fixed Degree
- Prologue to Swap on Trees
- Sum of Degree Sum of Spanning Subgraphs
- Sum of Degree Sum of Spanning Subgraphs (Hard)
- Induced Subgraphs with Fixed Degree
- Induced Subgraphs with Compressed Degree
- Prologue to Leaf Color

- Distinct Colors
- Confuzzle
- It is a tree : Subtask 2