-
Notifications
You must be signed in to change notification settings - Fork 95
/
BinaryTree.ts
197 lines (158 loc) · 3.78 KB
/
BinaryTree.ts
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
import { Node } from './Node'
export class Tree {
private root: Node<number>
private list: any [] = []
constructor () {
this.root = null
}
public getRoot (): Node<number> {
return this.root
}
public insert (data: number) {
let node = new Node<number>(data)
if (this.root === null) {
this.root = node
} else {
let current = this.root
let parent: Node<number> = null
while (current) {
parent = current
if (data < current.getData()) {
current = current.left
if (current === null) {
parent.left = node
break
}
} else {
current = current.right
if (current === null) {
parent.right = node
break
}
}
}
}
}
public inOrder (node: Node<number>) {
if (! (node === null)) {
this.inOrder(node.left)
this.list.push(node.getData())
this.inOrder(node.right)
}
}
public preOrder (node: Node<number>) {
if (!(node === null)) {
this.list.push(node.getData())
this.preOrder(node.left)
this.preOrder(node.right)
}
}
public postOrder (node: Node<number>) {
if (!(node === null)) {
this.preOrder(node.left)
this.preOrder(node.right)
this.list.push(node.getData())
}
}
public getList (): any[] {
return this.list
}
public clearList () {
this.list = []
}
public getMin (node): Node<number> {
let current = node
while (current.left) {
current = current.left
}
return current
}
public getMax (node): Node<number> {
let current = node
while (current.right) {
current = current.right
}
return current
}
public find (data): Node<number> {
let current = this.root
while (current) {
if (current.getData() === data) {
return current
} else if (data < current.getData()) {
current = current.left
} else {
current = current.right
}
}
return null
}
public deleteNode (node: Node<number>) {
if (node.left == null) {
this.transPlant(node, node.right)
} else if (node.right == null) {
this.transPlant(node, node.left)
} else {
let current = this.getMin(node.right)
if (current.parent !== node) {
this.transPlant(current, current.right)
current.right = node.right
current.right.parent = current
}
this.transPlant(node, current)
current.left = node.left
current.left.parent = current
}
}
public iterativePreOrder (node: Node<number>) {
const stack: Node<number>[] = []
if (!(node === null)) {
stack.push(node)
while (stack.length !== 0) {
node = stack.pop()
this.list.push(node.getData())
if (node.right !== null) {
stack.push(node.right)
}
if (node.left !== null) {
stack.push(node.left)
}
}
}
}
public iterativeInOrder (node: Node<number>) {
const stack: Node<number>[] = []
while (node !== null || stack.length > 0) {
while (node !== null) {
stack.push(node)
node = node.left
}
if (stack.length > 0) {
node = stack.pop()
this.list.push(node.getData())
node = node.right
}
}
}
private transPlant (u, v) {
if (u.parent === null) {
this.root = u
} else if (u === u.parent.left) {
u.parent.left = v
} else {
u.parent.right = v
}
if (v !== null) {
v.parent = u.parent
}
}
private invertTree (root) {
if (!root) return null
root.left = this.invertTree(root.left)
root.right = this.invertTree(root.right)
let tmp = root.left
root.left = root.right
root.riht = tmp
return root
}
}