Depth first traversal post order

Author: dhimasanb

binarySearchTree.js

@@ -36,6 +36,7 @@ BST.prototype.depthFirstTraversal = function(iteratorFunc, order) {
   if (this.left) this.left.depthFirstTraversal(iteratorFunc, order);
   if (order === "in-order") iteratorFunc(this.value);
   if (this.right) this.right.depthFirstTraversal(iteratorFunc, order);
+  if (order === "post-order") iteratorFunc(this.value);
 };
 
 let bst = new BST(50);
@@ -56,4 +57,4 @@ function log(value) {
   console.log(value);
 }
 
-bst.depthFirstTraversal(log, "pre-order");
+bst.depthFirstTraversal(log, "post-order");