You’re given a Node class that has a name and an array of optional children nodes. When put together, nodes form an acyclic tree-like structure.

Implement the depthFirstSearch method on the Node class, which takes in an empty array, traverses the tree using the Depth-first Search approach (specifically navigating the tree from left to right), stores all of the nodes’ names in the input array, and returns it.

If you’re unfamiliar with Depth-first Search, we recommend watching the Conceptual Overview section of this question’s video explanation before starting to code.

Sample Input

Copy
1graph = A
2     /  |  \
3    B   C   D
4   / \     / \
5  E   F   G   H
6     / \   \
7    I   J   K

Sample Output

Copy
1["A", "B", "E", "F", "I", "J", "C", "D", "G", "K", "H"]

Hints

Hint 1

The Depth-first Search algorithm works by traversing a graph branch by branch. In other words, before traversing any Node’s sibling Nodes, its children nodes must be traversed. How can you simply and effectively keep track of Nodes’ sibling Nodes as you traverse them, all the while retaining the order in which you must traverse them?

Hint 2

Start at the root Node and try simply calling the depthFirstSearch method on all of its children Nodes. Then, call the depthFirstSearch method on all children Nodes of each child node. Keep applying this logic until the entire graph has been traversed. Don’t forget to add the current Node’s name to the input array at every call of depthFirstSearch.

Optimal Space & Time Complexity

O(v + e) time | O(v) space - where v is the number of vertices of the input graph and e is the number of edges of the input graph

Copy
1// Do not edit the class below except
2// for the depthFirstSearch method.
3// Feel free to add new properties
4// and methods to the class.
5class Node {
6  constructor(name) {
7    this.name = name;
8    this.children = [];
9  }
10
11  addChild(name) {
12    this.children.push(new Node(name));
13    return this;
14  }
15
16  depthFirstSearch(array) {
17    array.push(this.name)
18        for (let i of this.children) {
19            i.depthFirstSearch(array)
20        }
21        return array
22  }
23}
24
25// Do not edit the line below.
26exports.Node = Node;

🔮