From 4df7abdb95059ad232175a61ff58fd324f06874a Mon Sep 17 00:00:00 2001
From: Stan Ulbrych <89152624+StanFromIreland@users.noreply.github.com>
Date: Mon, 12 May 2025 16:27:21 +0100
Subject: [PATCH] Add class

---
 Doc/library/heapq.rst | 1 +
 1 file changed, 1 insertion(+)

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.