Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added Doc/library/heapq-binary-tree.pdf
Binary file not shown.
2 changes: 1 addition & 1 deletion Doc/library/heapq.rst
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
Loading