Question
You MUST use Eclipse as IDE.
Your program MUST compile and run without error.
Write a link-list based implementation of heap interface.
It should have implementation for following four methods.
enqueue()
dequeue()
isEmpty()
isFull()
Solution Preview
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.
Node n = new Node(data, null, null, index);if (n.index < head.index) {
// a[2] = a [1], a[11 = a[0], a [0] = data
n.next = head;
head.prev = n;
head = n;
}else{
Node cur = head;
Node prev = null;
while (cur != null) {
if (cur.index == index) {
// set a[index] = data
cur.data = data;
break;
}else if (cur.index > index) {
// pass the right index
// create a new node infront of the current node
n.prev = cur.prev;
cur.prev.next = n;
n.next = cur;
cur.prev = n;
break;
void enqueue(T element);
// Precondition: element is Comparable
//
// Throws PriQOverflowException if this priority queue is full;
// otherwise, adds element to this priority queue....
By purchasing this solution you'll be able to access the following files:
Solution.zip.