diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 183ac9a27d55cd..462b65bc7afba4 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -315,6 +315,7 @@ 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
+   :class: invert-in-dark-mode
    :align: center
    :alt: Example (min-heap) binary tree.