二叉树js.html

function Node(data,left,right) {
    this.data = data;
    this.left = left;
    this.right = right;
  
}

function BST() {
    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(current) {
            parent = current;
            parent.Father = 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;
                }
            }
        }
    }
}




var nums = new BST();
nums.insert(23);
nums.insert(45);
nums.insert(16);
nums.insert(37);
nums.insert(3);
nums.insert(99);
nums.insert(122);
nums.insert(86);
nums.insert(20);
nums.insert(5);
nums.insert(19);
nums.insert(43);
nums.insert(454)

        //                  23
        //     16                    45
        // 3       20          37          99
        //   5  19                43    86    122