JavaScript-Algorithms-and-Data-Structures/binarySearchTree.js at master · lucas1004jx/JavaScript-Algorithms-and-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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134

class Node {
    constructor(value){
        this.value = value;
        this.left = null;
        this.right = null;
    }
}

class BinarySearchTree {
    constructor(){
        this.root = null;
    }

    insert(val){
        const newNode = new Node(val);
        if(!this.root) {
            this.root = newNode;
            return this;
        }
        const checkValue = (val, node,position) => {
            if(!node[position]) return node[position] = new Node(val);
            if(val > node[position].value){
                checkValue(val, node[position],'right');
            }else if(val < node[position].value){
               checkValue(val, node[position],'left');
            }else{
                throw new Error('Can not insert a value that already exits! ');
            }
        }

        if(val > this.root.value){
               checkValue(val,this.root,'right');
        }else if(val < this.root.value){
          checkValue(val,this.root,'left');
        }


        return this;
    }

    find(val){
        if(!this.root) return false;

        const checkValue = (val, node,position) => {
            if(!node[position]) return false;
            if(val > node[position].value){
                checkValue(val, node[position],'right');
            }else if(val < node[position].value){
                checkValue(val, node[position],'left');
            }else{
                return true;
            }
        }

        if(val > this.root.value){
           return  checkValue(val,this.root,'right');
        }else if(val < this.root.value){
            return checkValue(val,this.root,'left');
        }else{
            return true;
        }
    }


    BFS(){
        const queue = [];
        const visited = [];
        if(!this.root) return visited;
        queue.push(this.root);

            while(queue.length > 0){
                const node = queue.shift();
                visited.push(node.value);
                if(node.left) queue.push(node.left);
                if(node.right)queue.push(node.right);
            }

        return visited;

    }

   DFS_PreOrder(){
        const visited =[];
        if(!this.root) return visited;
        const traverse = (node) =>{
            visited.push(node.value);
            if(node.left) traverse(node.left);
            if(node.right)traverse(node.right);
        };
        traverse(this.root);
        return visited;
    }

     DFS_PostOrder(){
        const visited=[];

        if(!this.root) return visited;
        const traverse = (node) => {
            if(node.left) traverse(node.left);
            if(node.right)traverse(node.right);
            visited.push(node.value);

        };

        traverse(this.root);
        return visited;
    }

    DFS_InOrder(){
        const visited = [];
        if(!this.root) return visited;
        const traverse = (node) => {
            if(node.left) traverse(node.left);
            visited.push(node.value);
            if(node.right) traverse(node.right);
        };
        traverse(this.root);
        return visited;
    }
}


const tree = new BinarySearchTree();
tree.root = new Node(10);
//tree.root.right = new Node(15);
//tree.root.left = new Node(8);
tree.insert(6);
tree.insert(15);
tree.insert(3);
tree.insert(8);
tree.insert(20);