Depth First Search

depthFirstSearch.JS

function Node(value){
  this.value = value
  this.left = null;
  this.right = null;
}

Node.prototype.toString = function() {
  return this.value;
}  

Node.prototype.depthFirstSearch = function depthFirstSearch(rootNode) {
  if (rootNode === null) {
    return;
  }
  
  // Print the data of the node.
  console.log(rootNode.value);
  
  depthFirstSearch(rootNode.left);
  depthFirstSearch(rootNode.right);

}

Most DFS algorithms use a stack to implement however in our case we are using a recursion.