-
Notifications
You must be signed in to change notification settings - Fork 0
/
BreadthFirstSearch.js
99 lines (84 loc) · 1.82 KB
/
BreadthFirstSearch.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
class NewNode{
constructor(value){
this.value=value;
this.left=null;
this.right=null;
}
}
class BinarySearchTree{
constructor(value){
this.node=null;
this.length=0;
}
append(value){
let currentnode=this.node
let newnode=new NewNode(value)
if (currentnode===null){
this.node=newnode
this.length++
}
else{
while (currentnode){
if (value<currentnode.value){
if (!currentnode.left){
currentnode.left=newnode
this.length++;
return this
}
else{
currentnode=currentnode.left
}
}
else{
if (!currentnode.right){
currentnode.right=newnode;
this.length++;
return this;
}
else{
currentnode=currentnode.right}
}
}}}
lookup(value){
let currentnode=this.node;
while(currentnode){
if (value<currentnode.value){
currentnode=currentnode.left
}
else if(value>currentnode.value){
currentnode=currentnode.right
}
else if(currentnode.value===value){
return currentnode;
}
}
return "None"
}
breadthfirstsearch(){
let currentnode=this.node;
let queue=[]
let list=[]
queue.push(currentnode)
while (queue.length>0){
currentnode=queue.shift()
console.log(currentnode)
list.push(currentnode.value)
if (currentnode.left){
console.log("yes")
queue.push(currentnode.left)
}
if (currentnode.right){
console.log("yes")
queue.push(currentnode.right)
}
}
return list
}
}
tree=new Tree()
tree.append(2)
tree.append(1)
tree.append(13)
tree.append(33)
tree.append(11)
console.log(tree.breadthfirstsearch())