Implement Depth Search in a Node

DepthSearchNode.cpp

// https://www.algoexpert.io/questions/Depth-first%20Search

#include <vector>
using namespace std;

// Do not edit the class below except
// for the depthFirstSearch method.
// Feel free to add new properties
// and methods to the class.
class Node {
public:
  string name;
  vector<Node *> children;

  Node(string str) { name = str; }

  // ACTUAL IMPLEMENTATION
  // Time = BigO(vertices + edges) Space = BigO(edges)
  vector<string> depthFirstSearch(vector<string> *array) {
		array->push_back(this->name); // This is a pointer.
    for (Node* node : this->children) {
			node->depthFirstSearch(array); // Implement function in it's node method of children.
		}
    return *array;
  }

  Node *addChild(string name) {
    Node *child = new Node(name);
    children.push_back(child);
    return this;
  }
};