-
Notifications
You must be signed in to change notification settings - Fork 0
/
BookNode.java
415 lines (372 loc) · 12.1 KB
/
BookNode.java
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
/**
*BookNode
*Represents a node in the bookTree.
*/
public class BookNode
{
private String bookName; //book name
private String clientName; //name of the client who loaned the book
private String clientId; //client id
private BookNode left; //left son
private BookNode right; //right son
private BookNode p; //parent
private String color; //color of node
/**
* Constructor
* @param clientName- name of the client who loaned the book
* @param clientId- id of the client,
*/
public BookNode(String bookName, String clientName, String clientId)
{
this.bookName=bookName;
this.clientName=clientName;
this.clientId=clientId;
this.left=null;
this.right=null;
this.p=null;
this.color="RED";
}
/**
* RBinsert - inserts a new node to the tree
* @param node- a node insert to the RBtree
*/
public BookNode RBinsert(BookNode root, BookNode node)
{
boolean found=false;
BookNode x=root;
BookNode y=null;
while (!found) //while we didn't find the place to put the node
{
y=x;
if (node.bookName.compareTo(x.bookName)<0)
{
if (x.left!=null) x=x.left;
else found=true;
}
else
{
if (x.right!=null) x=x.right;
else found=true;
}
}
node.p=y;
if (node.bookName.compareTo(x.bookName)<0)
y.left=node;
else y.right=node;
node.left=null;
node.right=null;
node.color="RED";
root=RBinsertFix(root, node); //fix the tree after the insertion
return root; //return the new root of the tree
}
/**
* RBinsertFix - fix the tree after an insertion
* @param node- a node to insert to the RBtree
*/
public BookNode RBinsertFix(BookNode root, BookNode node)
{
node.color="RED";
//Correct double red problems, if they exist
if (node!=null && node!=root && node.p!=null && node.p.color.equals("RED"))
{
if (node.getSilbing(node.p)!=null && node.getSilbing(node.p).color.equals("RED"))
{//Recolor, and move up to see if more work needed
node.p.color="BLACK";
node.getSilbing(node.p).color="BLACK";
node.getGrandparent(node).color="RED";
root=RBinsertFix(root, node.getGrandparent(node));
}
else if (node.getGrandparent(node)!=null && node.p==node.getGrandparent(node).left)
{ //Restructure for a parent who is the left child of the
// grandparent. This will require a single right rotation if n is
// also a left child, or a left-right rotation otherwise.
if (node==node.p.right)
root=leftRotate(root, node=node.p);
node.p.color="BLACK";
node.getGrandparent(node).color="RED";
root=rightRotate(root, node.getGrandparent(node));
}
else if (node.getGrandparent(node)!=null && node.p==node.getGrandparent(node).right)
{ //Restructure for a parent who is the right child of the
// grandparent. This will require a single left rotation if n is
// also a right child, or a right-left rotation otherwise.
if (node==node.p.left)
rightRotate(root, node=node.p);
node.p.color="BLACK";
node.getGrandparent(node).color="RED";
root=leftRotate(root, node.getGrandparent(node));
}
}
root.color="BLACK"; //color the root in black
return root;
}
/**
* getSilbing - return the brother of the input node
*/
private BookNode getSilbing(BookNode node)
{
return (node == null || node.p == null) ? null : (node == node.p.left) ? (BookNode) node.p.right
: (BookNode) node.p.left;
}
/**
* getGrandparent - return the Grandparent of the input node
*/
private BookNode getGrandparent(BookNode node) {
return (node == null || node.p == null) ? null : (BookNode) node.p.p;
}
/**
* rightRotate - rotate the tree right
* @param node- a node that we rotate right in the RBtree
*/
public BookNode rightRotate(BookNode root, BookNode node)
{
BookNode y=node.left;
if (y!=null && y.right!=null)
{
node.left=y.right;
y.right.p=node;
}
else node.left=null;
if (node.p==null)
{
if (y!=null)
{
y.p=null;
root=y;
}
}
else {
if (y!=null) y.p=node.p;
if (node==node.p.right)
node.p.right=y;
else node.p.left=y;
}
if (y!=null) y.right=node;
node.p=y;
return root;
}
/**
* leftRotate - rotate the tree left
* @param node- a node that we rotate left in the RBtree
*/
public BookNode leftRotate(BookNode root, BookNode node)
{
BookNode y=node.right;
if (y!=null && y.left!=null)
{
node.right=y.left;
y.left.p=node;
}
else node.right=null;
if (node.p==null)
{
if (y!=null)
{
y.p=null;
root=y;
}
}
else {
y.p=node.p;
if (node==node.p.left)
node.p.left=y;
else node.p.right=y;
}
if (y!=null) y.left=node;
node.p=y;
return root;
}
/**
* treeSearch - search for a node in the tree. Return the node we are looking for
* @param bookName- the name of the book we are looking for
*/
public BookNode treeSearch(BookNode root, String bookName)
{
if (root==null)
return null;
if (bookName.equals(root.bookName))
return root;
if (root.left!=null && bookName.compareTo(root.bookName)<0)
{
return treeSearch(root.left, bookName);
}
else if (root.right!=null)
{
return treeSearch(root.right, bookName);
}
return null;
}
/**
* treeMinimum - return the minimum of the tree
*/
public BookNode treeMinimum(BookNode root)
{
BookNode temp=root;
while (temp.left!=null)
temp=temp.left;
return temp;
}
/**
* treeSuccessor - return the successor (by ascii value) of the input node
* @param node- a node that we are looking for its successor
*/
public BookNode treeSuccessor(BookNode root, BookNode node)
{
if (node.right!=null)
return treeMinimum(node.right);
if (node==root) //if node=root and there's not a right son, there is no successor
return null;
BookNode y=node.p;
while (y!=null && y.right!=null && node==y.right)
{
node=y;
y=y.p;
}
return y;
}
/**
* RBdelete - delete a node from the tree. Return the new root of the tree after the delete
* @param node- a node that we are deleting from the tree
*/
public BookNode RBdelete(BookNode root, BookNode node)
{
BookNode x, y, tmp;
if (node==null)
return root;
if (node.left==null || node.right==null)
y=node;
else y=node.treeSuccessor(root, node);
if (y.left!=null)
x=y.left;
else x=y.right;
if (x!=null)
x.p=y.p;
tmp=y.p;
if (y.p==null)
root=x;
else {
if (y==y.p.left)
y.p.left=x;
else y.p.right=x;
}
if (y!=node)
{
node.bookName=y.bookName;
node.clientId=y.clientId;
node.clientName=y.clientName;
}
if (y.color.equals("BLACK"))
root=RBdeleteFix(root, x, tmp);
return root;
}
/**
* RBdeleteFix - fix the tree after the delete and return the new root of the tree
* @param node- where the delete was done
* @param nodeP- the father of node. we send it to the method so we can know who the father is, if node=null
*/
public BookNode RBdeleteFix(BookNode root, BookNode node, BookNode nodeP)
{
BookNode w;
while (node!=root && getColor(node).equals("BLACK"))
{
if (node==nodeP.left)
{
w=nodeP.right;
if (getColor(w).equals("RED"))
{
w.color="BLACK";
nodeP.color="RED";
root=leftRotate(root, nodeP);
w=nodeP.right;
}
if (getColor(w.left).equals("BLACK") && getColor(w.right).equals("BLACK"))
{
w.color="RED";
node=nodeP;
}
else {
if (getColor(w.right).equals("BLACK"))
{
w.left.color="BLACK";
w.color="RED";
root=rightRotate(root, w);
w=nodeP.right;
}
if (w!=null) w.color=nodeP.color;
nodeP.color="BLACK";
if (w!=null && w.right!=null) w.right.color="BLACK";
root=leftRotate(root, nodeP);
node=root;
}
}
else {
w=nodeP.left;
if (getColor(w).equals("RED"))
{
w.color="BLACK";
nodeP.color="RED";
root=leftRotate(root, nodeP);
w=nodeP.left;
}
if (getColor(w.right).equals("BLACK") && getColor(w.left).equals("BLACK"))
{
w.color="RED";
node=nodeP;
}
else {
if (getColor(w.left).equals("BLACK"))
{
w.right.color="BLACK";
w.color="RED";
root=leftRotate(root, w);
w=nodeP.left;
}
if (w!=null) w.color=nodeP.color;
nodeP.color="BLACK";
if (w!=null && w.left!=null) w.left.color="BLACK";
root=rightRotate(root, nodeP);
node=root;
}
}
nodeP=nodeP.p;
}
if (node!=null) node.color="BLACK";
if (root!=null) root.color="BLACK"; //if the tree is not empty after the removal
return root;
}
//return the color of the node. if the node is null, return BLACK
public String getColor(BookNode node)
{
return node==null ? "BLACK" : node.color;
}
//set the color of the node to the input
public void setColor(String color)
{
this.color=color;
}
//retutrn the right son
public BookNode getRight()
{
return right;
}
//return the left son
public BookNode getLeft()
{
return left;
}
//return the name of the book
public String getBookName()
{
return bookName;
}
//return the name of the client who loaned the book
public String getClientName()
{
return clientName;
}
//return the id of the client who loaned the book
public String getClientId()
{
return clientId;
}
}