Depth First Search

Category: Graphs

```

Problem Statement

(Problem statement not extracted)

```

Approach & Solution

Solution 1

```java import java.util.*; class Program { static class Node { String name; List children = new ArrayList(); public Node(String name) { this.name = name; } // O(v + e) time | O(v) space public List depthFirstSearch(List array) { array.add(this.name); for (int i = 0; i < children.size(); i++) { children.get(i).depthFirstSearch(array); } return array; } public Node addChild(String name) { Node child = new Node(name); children.add(child); return this; } } }

```

Code Template

```java import java.util.*;

class Program { // Do not edit the class below except // for the depthFirstSearch method. // Feel free to add new properties // and methods to the class. static class Node { String name; List children = new ArrayList();

public Node(String name) {
  this.name = name;
}

public List<String> depthFirstSearch(List<String> array) {
  // Write your code here.
  return null;
}

public Node addChild(String name) {
  Node child = new Node(name);
  children.add(child);
  return this;
}

} }

```