This program will read integers from the keyboard, insert them into a max-heap, and display them as they are deleted from the heap. Most of the code is given: - Heap.h - Heap.cpp - main.cpp Your task is to finish defining four function in Heap.cpp: - insertHeap - deleteHeap - _reHeapUp - _reHeapDown
86 lines
2.2 KiB
C++
86 lines
2.2 KiB
C++
/* *~*~*
|
|
Implementation file for the Heap class: max-heap of integers
|
|
Written By: Iurii Tatishchev
|
|
Changed by: Iurii Tatishchev
|
|
IDE: CLion
|
|
*~**/
|
|
|
|
#include <utility>
|
|
#include "Heap.h"
|
|
|
|
/* *~*~*
|
|
The private member function _reHeapUp rearranges the heap after insert by moving the
|
|
last item up to the correct location in the heap
|
|
*~**/
|
|
void Heap::_reHeapUp(int lastndx) {
|
|
|
|
// base case, newElement is heap's root
|
|
if (lastndx == 0) return;
|
|
|
|
int parentIndex = _findParent(lastndx);
|
|
// base case, newElement satisfies heap property (child not greater than parent)
|
|
if (heapAry[lastndx] <= heapAry[parentIndex]) return;
|
|
|
|
// swap and continue recursing
|
|
std::swap(heapAry[lastndx], heapAry[parentIndex]);
|
|
_reHeapUp(parentIndex);
|
|
}
|
|
|
|
/* *~*~*
|
|
The private member function _reHeapDown rearranges the heap after delete by moving the
|
|
data in the root down to the correct location in the heap
|
|
*~**/
|
|
void Heap::_reHeapDown(int rootdex) {
|
|
int maxChildIndex = -1;
|
|
|
|
int left = _findLeftChild(rootdex);
|
|
int right = _findRightChild(rootdex);
|
|
|
|
// if there is a left child
|
|
if (left != -1) {
|
|
// if there is a right child that is greater than the left child
|
|
if (right != -1 && heapAry[right] > heapAry[left]) maxChildIndex = right;
|
|
else maxChildIndex = left;
|
|
}
|
|
|
|
// base case, heap property satisfied (children less than parent)
|
|
if (maxChildIndex == -1 || heapAry[rootdex] > heapAry[maxChildIndex]) return;
|
|
|
|
// swap and continue recursing
|
|
std::swap(heapAry[rootdex], heapAry[maxChildIndex]);
|
|
_reHeapDown(maxChildIndex);
|
|
}
|
|
|
|
/* *~*~*
|
|
The public member function insertHeap inserts a new item into a heap.
|
|
It calls _reheapUp.
|
|
*~**/
|
|
bool Heap::insertHeap(int newItem) {
|
|
if (isFull()) {
|
|
return false;
|
|
}
|
|
|
|
heapAry[count] = newItem;
|
|
_reHeapUp(count);
|
|
count++;
|
|
|
|
return true;
|
|
}
|
|
|
|
/* *~*~*
|
|
The public member function deleteHeap deletes the root of the heap and
|
|
passes back the root's data. It calls _reheapDown.
|
|
*~**/
|
|
bool Heap::deleteHeap(int &returnItem) {
|
|
if (isEmpty()) {
|
|
return false;
|
|
}
|
|
|
|
returnItem = heapAry[0];
|
|
heapAry[0] = heapAry[count - 1];
|
|
count--;
|
|
_reHeapDown(0);
|
|
|
|
return true;
|
|
}
|