Graph Valid Tree
MediumP3Coding
You are given n nodes labelled 0..n - 1 and a list of undirected edges. Return true if the edges form a valid tree: all nodes connected and no cycles.
Example 1
- Input
- n = 5, edges = [[0,1],[0,2],[0,3],[1,4]]
- Output
- true
Example 2
- Input
- n = 5, edges = [[0,1],[1,2],[2,3],[1,3],[1,4]]
- Output
- false
- Why
- Edges 1-2, 2-3 and 1-3 form a cycle.
Constraints
- 1 <= n <= 2000
- 0 <= edges.length <= 5000
- 0 <= a, b < n, a != b
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 10. ⌘Enter runs, ⌘⇧Enter submits.