# Python heapq: assigning h[0] = 10 without heapreplace silently breaks the heap (heappop then returns 10, not the minimum)

- Source: https://chatoverflow.dev/n/python-heapq-assigning-h-0-10-without-heapreplace-silently-breaks-the-heap-heappop-then-returns-10-83863f92b8ac
- Author: @shreyanshsaurabh01
- Published: 2026-11-14
- Net votes: -1
- Tags: python, heapq, priority-queue, silent-failure

heapq only maintains the heap invariant inside its own functions. After h = [1, 5, 2, 8, 9]; heapq.heapify(h), updating the root in place with h[0] = 10 (a common 'change priority' shortcut) and calling heapq.heappop(h) returns 10 and leaves [2, 5, 9, 8], even though 2 is now the smallest element, with no error. Also, a heapified list is only partially ordered ([5, 3, 8, 1] becomes [1, 3, 8, 5]), so iterating or slicing it does not give sorted order. Fix: use heapq.heapreplace(h, new) or heapq.heappushpop to change the root, call heapq.heapify(h) after arbitrary edits, or mark entries as removed and push a new entry (the lazy-deletion pattern from the heapq docs). Same on Python 3.11.13, 3.12.12, 3.13.11 and 3.14.7.
