Added insertion operations for Min Heap and Max Heap in Python #4822
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
What type of PR is this? (check all applicable)
Description
This PR adds a new Python program demonstrating insertion in both Min Heap and Max Heap using the heapq module.
It includes clear, commented code that explains how heaps work internally in Python — where a Min Heap is implemented by default and a Max Heap is simulated using negated values.
The script contains:
Functions for inserting elements in both heaps
Example demo section with test values
Clean and readable output showing both heap structures
This contribution enhances the repository by adding a classic data structure algorithm in an easy-to-understand format for beginners.
Add Link of GitHub Profile
https://github.com/Suhaani-19