Nov 2, 2025 · Nov 10, 2025
diff --git a/Doc/library/heapq-binary-tree.pdf b/Doc/library/heapq-binary-tree.pdf
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
 The strange invariant above is meant to be an efficient memory representation
 for a tournament.  The numbers below are *k*, not ``a[k]``:

 .. figure:: heapq-binary-tree.svg
 .. figure:: heapq-binary-tree.*
   :class: invert-in-dark-mode
   :align: center
   :alt: Example (min-heap) binary tree.
Original file line number	Diff line number	Diff line change
Expand Up		@@ -350,7 +350,7 @@ that ``a[0]`` is always its smallest element.
		The strange invariant above is meant to be an efficient memory representation
		for a tournament. The numbers below are k, not ``a[k]``:

		.. figure:: heapq-binary-tree.svg
		.. figure:: heapq-binary-tree.*
		:class: invert-in-dark-mode
		:align: center
		:alt: Example (min-heap) binary tree.
Expand Down