Initial commit
This commit is contained in:
@@ -0,0 +1,47 @@
|
||||
BinaryHeap.h - Header file for binary heap
|
||||
|
||||
#ifndef BINARY_HEAP_H_
|
||||
#define BINARY_HEAP_H_
|
||||
|
||||
#include "dsexceptions.h"
|
||||
#include "vector.h"
|
||||
|
||||
// BinaryHeap class
|
||||
//
|
||||
// CONSTRUCTION: with an optional capacity (that defaults to 100)
|
||||
//
|
||||
// ******************PUBLIC OPERATIONS*********************
|
||||
// void insert( x ) --> Insert x
|
||||
// deleteMin( minItem ) --> Remove (and optionally return) smallest item
|
||||
// Comparable findMin( ) --> Return smallest item
|
||||
// bool isEmpty( ) --> Return true if empty; else false
|
||||
// bool isFull( ) --> Return true if full; else false
|
||||
// void makeEmpty( ) --> Remove all items
|
||||
// ******************ERRORS********************************
|
||||
// Throws Underflow and Overflow as warranted
|
||||
|
||||
template <class Comparable>
|
||||
class BinaryHeap
|
||||
{
|
||||
public:
|
||||
explicit BinaryHeap( int capacity = 100 );
|
||||
|
||||
bool isEmpty( ) const;
|
||||
bool isFull( ) const;
|
||||
const Comparable & findMin( ) const;
|
||||
|
||||
void insert( const Comparable & x );
|
||||
void deleteMin( );
|
||||
void deleteMin( Comparable & minItem );
|
||||
void makeEmpty( );
|
||||
|
||||
private:
|
||||
int currentSize; // Number of elements in heap
|
||||
vector<Comparable> array; // The heap array
|
||||
|
||||
void buildHeap( );
|
||||
void percolateDown( int hole );
|
||||
};
|
||||
|
||||
#include "BinaryHeap.cpp"
|
||||
#endif
|
||||
Reference in New Issue
Block a user