Data-Structure/binary-tree.js at master · saeed-vayghan/Data-Structure · 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
135
136
137
138
139
140
141
142
143
/*
  Binary Tree
    A
  B   C
  B < A , C > A
*/


function Tree(data, left = null, right = null) {
  this.data  = data;
  this.left  = left;
  this.right = right;

  this.insert = function (val) {

    if ( val <= this.data ) {

      if ( this.left === null ) {
        this.left = new Tree(val);

      } else {

        this.left.insert(val);
      }
    }

    if ( val > this.data ) {

      if ( this.right === null ) {
        this.right = new Tree(val);

      } else {

        this.right.insert(val);
      }
    }
  }

  this.find = function(val) {
    if ( this.data === val ) {
      return true;
    }

    if ( val <= this.data ) {
      if ( this.left === null ) {
        return false;
      }

      return this.left.find(val);
    }

    if ( val > this.data ) {
      if ( this.right === null ) {
        return false;
      }

      return this.right.find(val);
    }
  }

  this.findMin = function() {
    let min = this;

    while (min.left !== null) {
      min = min.left;
    }

    return min.data;
  }

  this.findMax = function() {
    let max = this;

    while (max.right !== null) {
      max = max.right;
    }

    return max.data;
  }

  this.inOrder = function () {
    if ( this.left !== null ) {
      this.left.inOrder();
    }

    console.log(this.data);

    if ( this.right !== null ) {
      this.right.inOrder();
    }
  }

  this.preOrder = function () {
    console.log(this.data);

    if ( this.left !== null ) {
      this.left.inOrder();
    }

    if ( this.right !== null ) {
      this.right.inOrder();
    }
  }

  this.postOrder = function () {
    if ( this.left !== null ) {
      this.left.inOrder();
    }

    if ( this.right !== null ) {
      this.right.inOrder();
    }

    console.log(this.data);
  }

  this.printt = function(method) {
    if ( method === 'inOrder' ) {
      return this.inOrder();
    }
  }
};


const tree = new Tree(10);

tree.insert(7);
tree.insert(12);
tree.insert(11);
tree.insert(5);
tree.insert(14);
tree.insert(20);
tree.insert(15);

console.log('Max:', tree.findMax())
console.log('Min:', tree.findMin())

console.log('find 100', tree.find(100))
console.log('find 14', tree.find(14))

tree.printt('inOrder');