Binary Search Tree - Independent Exercise

https://subscription.packtpub.com/video/programming/9781800206878/p3/video3_17/-binary-search-tree-independent-exercise

by Dominic Myers

JavaScript

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.contains = function(value) {
  if (value === this.value) {
    return true;
  } else if (value < this.value) {
    if (!this.left) {
      return false;
    } else {
      return this.left.contains(value);
    }
  } else if (value > this.value) {
    if (!this.right) {
      return false;
    } else {
      return this.right.contains(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.bredthFirstTraversal = 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(){
	var currentNode = this
	while(currentNode.left){
  	currentNode = currentNode.left;
  }
  return currentNode.value;
}

BST.prototype.getMaxVal = function(){
	var currentNode = this
	while(currentNode.right){
  	currentNode = currentNode.right;
  }
  return currentNode.value;
}

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

console.log(bst.getMinVal())
console.log(bst.getMaxVal())