Javascript Data Structures- Binary Seach Tree, find min and max values

BinarySearchTree-with-min_max

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


BST.prototype.insert = function(value){
  if(value<= this.value){
    if(!this.left) this.left = new BST(value);
    else this.left.insert(value)
  }
  else if(value>this.value){
    if(!this.right) this.right = new BST(value);
    else this.right.insert(value);
  }
}


BST.prototype.depthFirstTraversal = function(iteratorFunc, order){
  if(order==='pre-order')iteratorFunc(this.value);
  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);
}


BST.prototype.breadthFirstTraversal = function(iteratorFunc){
  var queue = [this];
  while(queue.length){
    var treeNode = queue.shift();
    iteratorFunc(treeNode);
    if(treeNode.left) queue.push(treeNode.left);
    if(treeNode.right) queue.push(treeNode.right);
  }
  
}




BST.prototype.getMinVal = function(targetNode){
 if(!targetNode) targetNode = this;
  // For minimum value of BST
  if(targetNode.left){
    if(targetNode.left.value<targetNode.value){targetNode.left.getMinVal();}
  }
  else{
    console.log('Min Value of BST: '+ targetNode.value);
  }
}


BST.prototype.getMaxVal = function(targetNode){
 if(!targetNode) targetNode = this;
  // For max value of BST
    if(targetNode.right){
    if(targetNode.right.value>targetNode.value){targetNode.right.getMaxVal();}
  }
  else{
    console.log('Max Value of BST: '+ targetNode.value);
  }
}






var bst = new BST(50);
bst.insert(30);
bst.insert(70);
bst.insert(100);
bst.insert(60);
bst.insert(59);
bst.insert(20);
bst.insert(45);
bst.insert(35);
bst.insert(85);
bst.insert(105);
bst.insert(10);





bst.getMinVal();
bst.getMaxVal();










// console.log(bst.contains(105));
    // bst.depthFirstTraversal(log, 'in-order');
// 
      // bst.depthFirstTraversal(log, 'pre-order');
// bst.depthFirstTraversal(log, 'post-order');


// function log(node){
//   console.log(node.value);
// }


// bst.breadthFirstTraversal(log);