-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST.js
102 lines (101 loc) · 2.67 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
class Node{
constructor(value){
this.value = value;
this.left = null;
this.right = null;
}
}
class BinarySearchTree{
constructor(){
this.root = null;
}
insert(value){
let newNode = new Node(value);
if (!this.root){
this.root = newNode;
return this;
}
let current = this.root;
while(true){
if (value === current.value) return undefined;
if (value < current.value){
if (current.left === null){
current.left = newNode;
return this;
}
current = current.left;
}else{
if (current.right === null){
current.right = newNode;
return this;
}
current = current.right;
}
}
}
find(value){
if (!this.root) return undefined;
let current = this.root;
while(true){
if (value === current.value) return current;
if (value < current.value){
if (!current.left) return undefined;
current = current.left;
}else{
if (!current.right) return undefined;
current = current.right;
}
}
}
BFS(){
let node = this.root;
let queue = [];
let visited = [];
queue.push(node);
while(queue.length){
node = queue.shift();
visited.push(node.value);
if (node.left) queue.push(node.left);
if (node.right) queue.push(node.right);
}
return visited;
}
DFSpreorder(){
let visited = [];
function traverse(node){
visited.push(node.value);
if (node.left) traverse(node.left);
if (node.right) traverse(node.right);
}
traverse(this.root);
return visited;
}
DFSpostorder(){
let visited = [];
function traverse(node){
if (node.left) traverse(node.left);
if (node.right) traverse(node.right);
visited.push(node.value);
}
traverse(this.root);
return visited;
}
DFSinorder(){
let visited = [];
function traverse(node){
if (node.left) traverse(node.left);
visited.push(node.value);
if (node.right) traverse(node.right);
}
traverse(this.root);
return visited;
}
}
let tree = new BinarySearchTree();
tree.insert(15);
tree.insert(10);
tree.insert(9);
tree.insert(18);
tree.insert(16);
tree.insert(19);
tree.insert(3);