forked from MakeContributions/DSA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
MinHeap.java
177 lines (147 loc) · 5.64 KB
/
MinHeap.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
/*
Min-Heap is a binary tree structure such that every node in the tree will be
lesser or equal to the child node. It is used when you need quick access to
the smallest number in the array.
Time complexity to build the heap: O(n)
Time complexity to remove min: O(log(n))
Time complexity to remove all elements: O(n*log(n))
*/
import java.util.ArrayList;
import java.util.Collections;
import java.util.stream.Collectors;
public class MinHeap<T extends Comparable<? super T>> {
// Example of MinHeap usage
public static void main(String[] args) {
MinHeap<Integer> myHeap = new MinHeap<>();
// adding elements to the heap
myHeap.insert(4);
myHeap.insert(10);
myHeap.insert(2);
myHeap.insert(22);
myHeap.insert(45);
myHeap.insert(18);
System.out.println(myHeap);
// output: 2, 10, 4, 22, 45, 18
myHeap.removeMin();
System.out.println(myHeap);
// output: 4, 10, 18, 22, 45
myHeap.removeMin();
System.out.println(myHeap);
// output: 10, 22, 18, 45
myHeap.removeMin();
System.out.println(myHeap);
// output: 18, 22, 45
myHeap.removeMin();
System.out.println(myHeap);
// output: 22, 45
myHeap.removeMin();
System.out.println(myHeap);
// output: 45
myHeap.removeMin();
System.out.println(myHeap);
// output:
// (empty output)
}
// Array representing the binary tree,
// where the first element is the smallest element and the root
ArrayList<T> items;
public MinHeap() {
this.items = new ArrayList<>();
}
/*
takes index of the node as argument,
and returns the index of its parent.
Returns -1 if the element is a root.
*/
public int getIndexOfParent(int index) {
return (index == 0) ? -1 : (index - 1) / 2;
}
/*
Takes index of the node as argument,
and returns the index of its first child.
The index of its second child is greater by one
than the index of the first child.
Returns -1 if the element at given index has no children
*/
public int getIndexOfFirstChild(int index) {
int result = (index * 2) + 1;
return (result >= items.size()) ? -1 : result;
}
/* swaps the element at given index with the its parent
until the order of the heap is restored (the parent is smaller or equal)
*/
public void siftUp(int index) {
if (index == 0) return;
T element = items.get(index);
int indexOfParent = getIndexOfParent(index);
while (indexOfParent != -1 && items.get(indexOfParent).compareTo(element) > 0) {
Collections.swap(items, index, indexOfParent);
index = indexOfParent;
indexOfParent = getIndexOfParent(index);
}
}
/* swaps the element at given index with the smallest of its children
until the order of the heap is restored (both children are greater or equal)
*/
public void siftDown(int index) {
int firstChildIndex = getIndexOfFirstChild(index);
int secondChildIndex = firstChildIndex + 1;
T element = items.get(index);
/* minIndex is the index of the smallest child
minIndex is the index of the first child, if the element doesn't
have children (so firstChildIndex=-1), or if the element only has one
child, or if the first child is smaller than the second child.
minIndex is the index of the second child, if the second child
is smaller than the first child. */
int minIndex = (firstChildIndex != -1 &&
secondChildIndex < items.size() && items.get(firstChildIndex).compareTo(
items.get(secondChildIndex)) > 0) ?
secondChildIndex : firstChildIndex;
while (minIndex != -1 && element.compareTo(items.get(minIndex)) > 0) {
Collections.swap(items, minIndex, index);
index = minIndex;
firstChildIndex = getIndexOfFirstChild(index);
secondChildIndex = firstChildIndex + 1;
/* see above for explanation of minIndex */
minIndex = (firstChildIndex != -1 &&
secondChildIndex < items.size() && items.get(firstChildIndex).compareTo(
items.get(secondChildIndex)) > 0) ?
secondChildIndex : firstChildIndex;
}
}
/* Insert an element into the heap, preserving the correct order
of elements (children of a node have to be greater or equal to the node) */
public void insert(T element) {
items.add(element);
siftUp(items.size() - 1);
}
/* Remove the smallest element and return it.
The smallest element in a MinHeap
is always the root.
Correct order of elements has to be restored after removing the root.
*/
public T removeMin() {
if (items.isEmpty()) throw new IllegalStateException(
"Cannot remove an element from an empty heap!");
T result = items.get(0); //smallest element
//If the heap only has one element, no reordering needed after removing
if (items.size()==1) {
items.remove(0);
return result;
}
Collections.swap(items, 0, items.size() - 1);
items.remove(items.size() - 1);
siftDown(0);
return result;
}
public T getMin() {
return items.get(0);
}
/* Print the elements in the heap in the order they are stored
separated by , */
@Override
public String toString() {
return items.stream().map(Object::toString)
.collect(Collectors.joining(", "));
}
}