gitadmin/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-05-28 18:26:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix(curriculum): rename heap module to heapq and correct heap property outputs (#66113)

Browse Source
This commit is contained in:
lockinginfor2026-arch
2026-02-27 01:56:12 -08:00
committed by GitHub
parent e796c06e59
commit 0640350046
2 changed files with 10 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
curriculum/challenges/english/blocks/review-graphs-and-trees/67f39e06b8a11b2de9ccd361.md
+5 -2
View File
@@ -98,7 +98,7 @@ The heap property determines the relationship between parent and child nodes. Th
- The value of each parent node is less than or equal to the values of its children.
- The smallest element is at the root.
### Python `heap` module example
### Python `heapq` module example
```py
import heapq
@@ -110,12 +110,15 @@ my_heap = []
heapq.heappush(my_heap, 9)
heapq.heappush(my_heap, 3)
heapq.heappush(my_heap, 5)
print(my_heap) # [3, 9, 5]
# Remove smallest element
print(heapq.heappop(my_heap)) # 3
print(my_heap) # [5, 9]
# Push + Pop in one step
print(heapq.heappushpop(my_heap, 2)) # 2
print(heapq.heappushpop(my_heap, 7)) # 5
print(my_heap) # [7, 9]
# Transform list into heap
nums = [5, 7, 3, 1]
curriculum/challenges/english/blocks/review-python/67f39e391c9b373069def02c.md
+5 -2
View File
@@ -2823,7 +2823,7 @@ The heap property determines the relationship between parent and child nodes. Th
- The value of each parent node is less than or equal to the values of its children.
- The smallest element is at the root.
### Python `heap` module example
### Python `heapq` module example
```py
import heapq
@@ -2835,12 +2835,15 @@ my_heap = []
heapq.heappush(my_heap, 9)
heapq.heappush(my_heap, 3)
heapq.heappush(my_heap, 5)
print(my_heap) # [3, 9, 5]
# Remove smallest element
print(heapq.heappop(my_heap)) # 3
print(my_heap) # [5, 9]
# Push + Pop in one step
print(heapq.heappushpop(my_heap, 2)) # 2
print(heapq.heappushpop(my_heap, 7)) # 5
print(my_heap) # [7, 9]
# Transform list into heap
nums = [5, 7, 3, 1]