BST_TREE.js

/**
 * Created by kouzi on 2016/9/2.
 */
function Node(data,left,right){
    this.data = data;
    this.left = left;
    this.right  =right;
    this.show = show;
}
function show(){
    return this.data;
}
function TREE(){
    this.root = null;
    this.insert = insert;
    this.inOrder = inOrder;
}
function insert(data){
    var n = new Node(data,null,null);
    if(this.root == null){
        this.root = n;
    }else{
        var current = this.root;
        var parent ;
        while (true){
            parent = current;
            if(data < current.data){
                current = current.left;
                if(current == null){
                    parent.left = n;
                    break;
                }
            }
            else{
                current = current.right;
                if(current == null){
                    parent.right = n;
                    break;
                }
            }
        }
    }
}
function inOrder(){

}



var num= new TREE();
num.insert(12);
num.insert(32);
num.insert(11);
num.insert(4);
num.insert(54);
num.insert(123);
num.insert(99);
num.insert(2);
num.insert(6);
num.insert(23);
num.insert(2);
num.insert(2);
console.log(num);