data-structures/BinaryTree.js at master · JustineOverflow/data-structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

let myBinarySearchTree;
myBinarySearchTree = {
    root: null,

    insert: function (value) {
        let newNode = {
            data: value,
            right: null,
            left: null
        };

        let pointer = this.root;

        if (this.root === null) {
            this.root = newNode;

        } else {

            let isNull = false;

            while (isNull !== true) {

                if (newNode.data < pointer.data) {
                    if (pointer.left != null) {
                        pointer = pointer.left
                    } else {
                        pointer.left = newNode;
                        isNull = true;
                    }
                } else {
                    if (pointer.right != null) {
                        pointer = pointer.right
                    } else {
                        pointer.right = newNode;
                        isNull = true;
                    }

                }

            }
            }


    },
};

myBinarySearchTree.insert(4);
console.log(myBinarySearchTree);
myBinarySearchTree.insert(2);
console.log(myBinarySearchTree);
myBinarySearchTree.insert(8);
console.log(myBinarySearchTree);
myBinarySearchTree.insert(6);
console.log(myBinarySearchTree);