Javascript-Data-Structures/binaryTree.js at master · hoseinhamzei/Javascript-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
class BinaryTree{
    constructor(){
        this.root = null;
    }

    // insert in tree
    insert(val, pos, side){
        let newNode = new Node(val);
        if(!this.root){
            this.root = newNode;
        }else{
            let q = [];
            q.push(this.root);
            while(q.length > 0){


                temp = q.shift();

                if(temp)

                if(temp.left){
                    q.push(temp.left);
                }
                if(temp.right){
                    q.push(temp.right);
                }
            }

        }
    }

    // convert tree to array
    toArray(){
        if(!this.root){
            return [];
        }else{
            let q = [];
            q.push(this.root);
            let list = [];
            while(q.length > 0){


                let temp = q.shift();
                list.push(temp.val);

                if(temp.left){
                    q.push(temp.left);
                }
                if(temp.right){
                    q.push(temp.right);
                }
            }

            return list;


        }
    }

    // find if the tree has a node
    contains(val){
        if(!this.root){
            return false;
        }else{
            let q = [];
            q.push(this.root);
            let list = [];
            while(q.length > 0){


                let temp = q.shift();
                list.push(temp.val);

                if(temp.left){
                    q.push(temp.left);
                }
                if(temp.right){
                    q.push(temp.right);
                }
            }

            return list.includes(val);


        }
    }

    // remove node from the tree
    remove(val) {

      }

}


///////

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

////////
let bt = new BinaryTree();
bt.root = new Node(1);
bt.root.left = new Node(3);
bt.root.right = new Node(2);
bt.root.right.right = new Node(5);

console.log(bt.toArray());