Breadth first traversal

Author: dhimasanb

binarySearchTree.js

@@ -39,6 +39,16 @@ BST.prototype.depthFirstTraversal = function(iteratorFunc, order) {
   if (order === "post-order") iteratorFunc(this.value);
 };
 
+BST.prototype.breadthFirstTraversal = function(iteratorFunc) {
+  let queue = [this];
+  while (queue.length) {
+    let treeNode = queue.shift();
+    iteratorFunc(treeNode);
+    if (treeNode.left) queue.push(treeNode.left);
+    if (treeNode.right) queue.push(treeNode.right);
+  }
+};
+
 let bst = new BST(50);
 
 bst.insert(30);
@@ -53,8 +63,8 @@ bst.insert(85);
 bst.insert(105);
 bst.insert(10);
 
-function log(value) {
-  console.log(value);
+function log(node) {
+  console.log(node.value);
 }
 
-bst.depthFirstTraversal(log, "post-order");
+bst.breadthFirstTraversal(log);