Class MaxHeap<T>

Class representing a Max Heap data structure. A Max Heap is a complete binary tree where each node's value is greater than or equal to the values of its children.

Type Parameters

T
The type of values stored in the heap.

Index

Constructors

Accessors

Methods

extract extractMax insert isEmpty

Constructors

constructor

new MaxHeap<T>(): MaxHeap<T>
Type Parameters
- T
Returns MaxHeap<T>

Accessors

root

get root(): T
Gets the maximum value in the heap without removing it.

Returns T
- The root value of the heap, or null if the heap is empty.
- Defined in data-structures/heaps/MaxHeap.ts:111

size

get size(): number
Returns the number of elements currently in the heap.

Returns number
- The size of the heap.
- Defined in data-structures/heaps/MaxHeap.ts:120

Methods

extract

extract(): T
Extracts the maximum value (root) from the max heap.

Returns T
- The maximum value from the heap, or null if the heap is empty.
- Defined in data-structures/heaps/MaxHeap.ts:137

extractMax

extractMax(): T
Extracts the maximum value (root) from the max heap. After removing the root, it places the last element at the root and performs the bubble-down operation to restore the max-heap property.

Returns T
- The maximum value from the heap, or null if the heap is empty.
- Defined in data-structures/heaps/MaxHeap.ts:51

insert

insert(value): void
Inserts a value into the max heap. This method places the value at the end of the heap and then performs the bubble-up operation to maintain the max-heap property, ensuring that each parent node is greater than or equal to its children.
Parameters
- value: T
  The value to insert into the heap.
Returns void
- Defined in data-structures/heaps/MaxHeap.ts:17

isEmpty

isEmpty(): boolean
Checks if the heap is empty.

Returns boolean
- True if the heap is empty, false otherwise.
- Defined in data-structures/heaps/MaxHeap.ts:129