Challenge: Graph Valid Tree

Statement

Given an undirected graph containing $n$ nodes labeled from $0$ to $n - 1$, determine whether the graph is a valid tree or not. Return TRUE if the edges of the given graph make up a valid tree, and FALSE otherwise.

A graph is a valid tree when all the nodes are connected and there is no cycle between them.

Constraints:

Let $n$ be the number of nodes in the undirected graph, where:

• $1 \leq$ $n$ $\leq 10^2$

• $0 \leq$ $edges$ $\leq 5 \times 10^3$

• There are no repeated edges

• There are no self-loops

Examples