void Deque::push_front(int val) {
if (fr == ba) { ba++; } // The array was empty.
if (fr < 0) { // Room remains in the left half of the array.
expandArr(FRONT);
}
arr[fr] = val;
fr--;
vals++;
}
void Deque::push_back(int val) {
if (fr == ba) { fr--; } // The array was empty.
if (ba >= arrSize) {
expandArr(BACK);
}
arr[ba] = val;
ba++;
vals++;
}
void Heap::insert(Node *n) {
if (lastPosition == -1) {
arr[++lastPosition] = n;
numItems++;
return;
}
if (lastPosition >= size - 1) {
expandArr();
}
numItems++;
arr[++lastPosition] = n;
bubbleUp(lastPosition);
return;
}
