Implements a binary heap data structure for efficient priority queue operations. More...

#include <Heap.hpp>

Public Member Functions
	Heap (size_t initCapacity=16)
	~Heap ()
size_t	getSize () const
T	pop ()
	Removes and returns the root (min or max, per isMinHeap).
void	push (const T &value)
	Inserts value and restores the heap property.
T	top () const
	Returns the root without removing it.

Detailed Description

template<typename T, bool isMinHeap = true>
class Sleak::Heap< T, isMinHeap >

Implements a binary heap data structure for efficient priority queue operations.

The Heap class maintains a collection of elements with a specific ordering property (min-heap or max-heap). It is suitable for scenarios where you need to efficiently retrieve the minimum or maximum element. Use this class when you need to implement priority queues, scheduling algorithms, or heap-based sorting.

Example Use Cases:

Implementing a priority queue for task scheduling.
Finding the kth largest element in a data stream.
Implementing Dijkstra's shortest path algorithm.
Heap sort implementation.

Implementation Details:

Uses an array-based representation to store the heap elements.
Provides methods for inserting elements and extracting the minimum or maximum element.
Maintains the heap property after each operation.

Definition at line 28 of file Heap.hpp.