-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearchTree.js
62 lines (56 loc) · 1.51 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
class Node {
constructor(value) {
this.value = value
this.left = null
this.right = null
}
}
class BST {
constructor() {
this.root = null
}
insert(value) {
var newNode = new Node(value)
if(this.root === null) {
this.root = newNode
return this
} else {
var 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 === null) return false
var 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
}
}
/*--------Time Complexity------------
Insertion - O(log n)
Searching - O(log n)
*/