Binary Search Tree created by ZaynahGiti - https://repl.it/EPbx/4

Binary Search Tree.js

function BST(value) {
 this.value = value;
 this.right = null;
 this.left = 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 (this.value === value) return true;
 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.depthFirstForEach = function(iteratorFunc, order) {
 if (order === 'pre-order') iteratorFunc(this.value);
 if (this.left) this.left.depthFirstForEach(iteratorFunc, order);
 if (order === 'in-order') iteratorFunc(this.value);
 if (this.right) this.right.depthFirstForEach(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);
 }
};
 

Binary Search Tree Source Code