diff --git a/Doc/library/heapq-binary-tree.pdf b/Doc/library/heapq-binary-tree.pdf
new file mode 100644
index 00000000000000..b00725c1b57797
Binary files /dev/null and b/Doc/library/heapq-binary-tree.pdf differ
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 5049262306a228..f800edcfc0da2f 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -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.