-
Notifications
You must be signed in to change notification settings - Fork 0
/
AVLTree.java
136 lines (107 loc) · 2.9 KB
/
AVLTree.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
package project2;
import java.util.Random;
public class AVLTree {
private AVLNode root;
public AVLTree() {
root = null;
}
public AVLNode getRoot() {
return root;
}
public AVLTree(AVLNode root) {
this.root = root;
}
public void setRoot(AVLNode root) {
this.root = root;
}
public void display(AVLNode root) {
// check if the node is empty
if (root != null) {
display(root.getLeft());
System.out.println(root);
display(root.getRight());
}
}
public AVLNode Insert(AVLNode node, AVLNode current) {
if (current == null) {
return node;
} else {
if (node.getKey().compareTo(current.getKey()) < 0) // node smaller that current
{
current.setLeft(Insert(node, current.getLeft()));
} else if (node.getKey().compareTo(current.getKey()) > 0) // node bigger that current
{
current.setRight(Insert(node, current.getRight()));
}
else
return current;
current.updatedHeight();
if (!current.isBlanced()) {
System.out.print("Imbalance occurred at inserting ISBN " + node.getKey() + ";");
if (node.getKey().compareTo(current.getKey()) < 0) // first flag: L
{
if (node.getKey().compareTo(current.getLeft().getKey()) < 0) {
System.out.println("fixed in Left Rotation.");
return LLrotation(current);
} // LL
else {
System.out.println("fixed in LeftRight Rotation.");
return LRrotation(current);// LR
}
} else {
if (node.getKey().compareTo(current.getRight().getKey()) > 0) {
System.out.println("fixed in Right Rotation.");
return RRrotition(current);
} else {
System.out.println("fixed in RightLeft Rotation.");
return RLrotation(current);
}
}
}
return current;
}
}
public AVLNode LLrotation(AVLNode current) {
AVLNode parent = current.getLeft();
AVLNode node =parent.getRight();
parent.setRight(current);
current.setLeft(node);
current.updatedHeight();
parent.updatedHeight();
return parent;
}
public AVLNode LRrotation(AVLNode current) {
current.setLeft(RRrotition(current.getLeft()));
return LLrotation(current);
}
public AVLNode RRrotition(AVLNode current) {
AVLNode parent = current.getRight();
AVLNode node =parent.getLeft();
parent.setLeft(current);
current.setRight(node);
current.updatedHeight();
parent.updatedHeight();
return parent;
}
public AVLNode RLrotation(AVLNode current) {
current.setRight(LLrotation(current.getRight()));
return RRrotition(current);
}
/********use for AVL analyze***********/
public AVLNode randomInsert(AVLNode node, AVLNode root) {
// TODO Auto-generated method stub
if(root ==null)
return node;
Random rand = new Random();
int num = rand.nextInt(2);
if(num ==1) {
root.setRight(randomInsert(node, root.getRight()));
root.updatedHeight();
}
else {
root.setLeft(randomInsert(node, root.getRight()));
root.updatedHeight();
}
return null;
}
}