Closes #25910: fix dead and permanently redirected links in the docs. Thanks to SilentGhost for the patch.

1 files changed, 2 insertions, 2 deletions

diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 9fbbcc6904..e29a31b3b3 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -132,7 +132,7 @@ the iterable into an actual heap.
 Basic Examples
 --------------
 
-A `heapsort <http://en.wikipedia.org/wiki/Heapsort>`_ can be implemented by
+A `heapsort <https://en.wikipedia.org/wiki/Heapsort>`_ can be implemented by
 pushing all values onto a heap and then popping off the smallest values one at a
 time::
 
@@ -163,7 +163,7 @@ Heap elements can be tuples.  This is useful for assigning comparison values
 Priority Queue Implementation Notes
 -----------------------------------
 
-A `priority queue <http://en.wikipedia.org/wiki/Priority_queue>`_ is common use
+A `priority queue <https://en.wikipedia.org/wiki/Priority_queue>`_ is common use
 for a heap, and it presents several implementation challenges:
 
 * Sort stability:  how do you get two tasks with equal priorities to be returned