This repository was archived by the owner on Oct 1, 2025. It is now read-only.
Add MinHeap class implementation in Java #319
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Chiefpatwal
changed the title
|
please review and merge the pr |
|
This PR adds a generic MinHeap implementation in Java to the repository. The class includes the following features: Insertion (insert(T data)): Adds a new element while maintaining the min-heap property. Extraction of minimum (extractMin()): Removes and returns the smallest element. Peek (peek()): Returns the minimum element without removing it. Check if empty (isEmpty()): Returns true if the heap is empty. Size (size()): Returns the number of elements in the heap. Height (height()): Returns the height of the heap. Print heap (printHeap()): Prints elements in level order for debugging purposes. |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds a generic MinHeap implementation in Java to the repository. The class includes the following features:
Insertion (insert(T data)): Adds a new element while maintaining the min-heap property.
Extraction of minimum (extractMin()): Removes and returns the smallest element.
Peek (peek()): Returns the minimum element without removing it.
Check if empty (isEmpty()): Returns true if the heap is empty.
Size (size()): Returns the number of elements in the heap.
Height (height()): Returns the height of the heap.
Print heap (printHeap()): Prints elements in level order for debugging purposes.