> For the complete documentation index, see [llms.txt](https://maksimdan.gitbook.io/interview-practice-problems/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/261-graph-valid-tree.md).

# 261 Graph Valid Tree

Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.

For example:

Given n = 5 and edges = \[\[0, 1], \[0, 2], \[0, 3], \[1, 4]], return true.

Given n = 5 and edges = \[\[0, 1], \[1, 2], \[2, 3], \[1, 3], \[1, 4]], return false.

**Note:** you can assume that no duplicate edges will appear in edges. Since all edges are undirected, \[0, 1] is the same as \[1, 0] and thus will not appear together in edges.

**The Idea:** A tree is a graph without cycle. So run a cyclic detection algorithm on the graph. Having an undirected graph simplifies this. Using a graph traversal all the needs to be checked is whether one path leads into an already visited node. This is because edges are bidirectional. Consider the case where this will not work with an undirected graph.

```
a----b
|     |
c----d

a---.b
|    .
.     |
c---.d
```

**Complexity:** O(n) time and space

```python
def validTree(self, n, edges):
        """
        :type n: int
        :type edges: List[List[int]]
        :rtype: bool
        """
        g = {i: set() for i in range(0, n)}
        for s, e in edges:
            g[s].add(e)
            g[e].add(s)

        def cyclic(root, n):
            visited = set()
            stack = [root]

            while stack:
                top = stack.pop()
                if top in visited:
                    return True
                visited.add(top)
                for neighbor in g[top]:
                    if (neighbor not in visited):
                        stack.append(neighbor)
            return len(visited) != n
        return not cyclic(0, n)
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/261-graph-valid-tree.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.