@@ -36,13 +36,13 @@ const Node = (function Node() {
    visit(output = (value) => console.log(value)) {
      // Recursively go left
      if (this.left !== null) {
-        this.left.visit()
      }
      // Print out value
      output(this.value)
      // Recursively go right
      if (this.right !== null) {
-        this.right.visit()
      }
    }

@@ -116,20 +116,23 @@ const Tree = (function () {
    }

    // Inorder traversal
-    traverse() {
      if (!this.root) {
        // No nodes are there in the tree till now
        return
      }
-      this.root.visit()
    }

    // Start by searching the root
    search(val) {
-      const found = this.root.search(val)
-      if (found !== null) {
-        return found.value
      }
      // not found
      return null
    }

@@ -0,0 +1,66 @@