Binary Search Tree - Javascript

Binary Search Tree - Javascript

var BinarySearchTree = function() {
  this.root = null;
};

//build a tree
BinarySearchTree.prototype.insert = function(value) {
  
  //create a node object with the data as value
  var node = {
    value: value,
    left: null,
    right: null
  },
  
  var currentNode;
  
  if (this.root === null) {
    this.root = node;
  } else {
    currentNode = this.root;
    while(true) {
      if (currentNode.left > value) {
        if (currentNode.left === null) {
          currentNode.left = node;
          break;
        }
      } else if (currentNode.right < value) {  
        if (currentNode.right === null) {
          currentNode.right = node;
          break;
        }
      } else {
        break;
      }
    }
  }
};

BinarySearchTree.prototype.traverse = function() {
  
};