Graph Valid Tree
Try to solve the Graph Valid Tree problem.
We'll cover the following
Statement
Given n
as the number of nodes and an array of the edges
of a graph, find out if the graph is a valid tree. The nodes of the graph are labeled from to , and represents an undirected edge connecting the nodes and of the graph.
A graph is a valid tree when all the nodes are connected and there is no cycle between them.
Constraints:
-
n
-
edges.length
edges[i].length
- ,
n
- There are no repeated edges.
Examples
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy