-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST.js
103 lines (96 loc) · 2.48 KB
/
BST.js
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
class Node{
constructor(val){
this.val = val;
this.right = null;
this.left = null;
}
}
class BST{
constructor(){
this.root = null;
}
insert(val){
let newNode = new Node(val);
if(!this.root){
this.root = newNode;
} else {
let current = this.root;
while(true){
if(val === current.val) return undefined;
if(val < current.val){
if(current.left === null){
current.left = newNode;
return this;
} else {
current = current.left;
}
} else if( val > current.val){
if(current.right === null){
current.right = newNode;
return this;
} else {
current = current.right;
}
}
}
}
}
find(val){
if(!this.root) return false;
if(val === this.root){
return this.root;
}
let current = this.root;
let found = false;
while(current && !found){
if(val < current.val){
current = current.left;
} else if ( val > current.val){
current = current.right;
} else{
found = true;
}
}
if(!found){
return false;
}
return current;
}
contains(value){
if(this.root === null) return false;
let current = this.root,
found = false;
while(current && !found){
if(value < current.value){
current = current.left;
} else if(value > current.value){
current = current.right;
} else {
return true;
}
}
return false;
}
BFS(){
let node = this.root;
let data = [];
let queue = [];
queue.push(node);
while(queue.length){
node = queue.shift();
data.push(node.val);
if(node.left) queue.push(node.left);
if(node.right) queue.push(node.right);
}
return data;
}
}
let newNode = new BST();
newNode.insert(10);
newNode.insert(8);
newNode.insert(5);
newNode.insert(9);
newNode.insert(11);
newNode.insert(12);
newNode.insert(15);
console.log(newNode.BFS());