-
Notifications
You must be signed in to change notification settings - Fork 69
/
Copy pathbinarySearchTree.js
74 lines (70 loc) · 1.67 KB
/
binarySearchTree.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
class Node {
constructor(val) {
this.val = val;
this.left = null;
this.right = null;
}
}
class BinarySearchTree {
constructor() {
this.root = null;
}
insert(val) {
const node = new Node(val);
if (!this.root) {
this.root = node;
return node;
}
let current = this.root;
while (current) {
if (val < current.val) {
if (!current.left) {
current.left = node;
break;
}
current = current.left
} else {
if (!current.right) {
current.right = node;
break;
}
current = current.right
}
}
}
find(val) {
if (!this.root) {
return false;
}
let current = this.root;
while (current) {
if (val === current.val) {
return current;
}
if (current.right && val > current.val) {
current = current.right;
} else {
current = current.left;
}
}
return false;
}
// Breath first search
bfs() {
let node = this.root;
const queue = [node];
const data = [];
while (queue.length) {
node = queue.shift();
if (node.left) {
queue.push(node.left);
}
if (node.right) {
queue.push(node.right);
}
data.push(node.val);
}
return data;
}
}
module.exports = BinarySearchTree;