Skip to content

Create DataStructure- Heaps #21

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
jhamukesh998 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create DataStructure- Heaps #21

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions Create Heaps
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
import heapq
a = [11,22,31,4]
heapq.heapify(a)
print(heapq.heappop(a)) #4
print(heapq.heappop(a)) #11
print(heapq.heappop(a)) #22
print(heapq.heappop(a)) #31
print(a) #Empty

#heapq by default makes use of min heap concept. heapify builds heap, heappop pops smallest element from heap, heappush(a,4) pushes 4 in heap.
#For making use of max heap simply multiply all the elements with -1 and then use min heap concept and then change the sign of the value as an when required.