tree.js

function BinarySearchTree() { 
 
    var Node = function(key){ 
        this.key = key;        
        this.left = null;        
        this.right = null;    
    }; 
  var root = null;  } 
    this.insert = function(key){ 
 
        var newNode = new Node(key); 
        if (root === null){          
            root = newNode;     
        } else {         
            insertNode(root,newNode);} 
    }; 
    var insertNode = function(node, newNode){     
        if (newNode.key < node.key){          
            if (node.left === null){              
                node.left = newNode;           
            } else {             
                insertNode(node.left, newNode);       }     
            } else {         
                if (node.right === null){             
                    node.right = newNode;           
                } else {insertNode(node.right, newNode);
                }
            }
    };
    var tree = new BinarySearchTree(); 
    tree.insert(11); 
    tree.insert(7); 
    tree.insert(15); 
    tree.insert(5); 
    tree.insert(3); 
    this.inOrderTraverse = function(callback){     
        inOrderTraverseNode(root, callback);}
        var inOrderTraverseNode = function (node, callback) 
        {     
            if (node !== null) {          
        inOrderTraverseNode(node.left, callback);    
        callback(node.key);            
        inOrderTraverseNode(node.right, callback);
          } }; 
          function printNode(value){    
              console.log(value); } 
          tree.inOrderTraverse(printNode);