BST

Traversals.js

// - - - Pre Order - - - 
const PreOrder = (tree, cb) => {
  cb(tree.val);

  if (tree.left) {
    PreOrder(tree.left, cb);
  }

  if (tree.right) {
    PreOrder(tree.right, cb);
  }
};

// - - - In Order - - - 
const InOrder = (tree,cb) => {
  if(tree.left) {
    InOrder(tree.left,cb);
  }
 
  cb(tree.val); 
    
  if(tree.right) {
    InOrder(tree.right,cb);
  }  
};

//Possible Usage
let myBST; // = some binary search tree
InOrder(myBST, (value) => console.log(value);
        
// - - - Post Order - - -        
const PostOrder = (tree, cb) => {
  if (tree.left) {
    PostOrder(tree.left, cb);
  }

  if (tree.right) {
    PostOrder(tree.right, cb);
  }

  cb(tree.val);
};