TheAlgorithms/Python · error · IndexError

Can't get top element for the empty heap.

Error message

Can't get top element for the empty heap.

What it means

Raised by SkewHeap.top() when self._root is None, and by pop() via top — IndexError('Can't get top element for the empty heap.'). SkewHeap is the same pointer-based mergeable-heap design as RandomizedHeap (identical API shape), so the empty-heap guard and message are duplicated verbatim across both files. No root means no minimum element to return.

Source

Thrown at data_structures/heap/skew_heap.py:217

        """
        Return the smallest value from the heap.

        >>> sh = SkewHeap()
        >>> sh.insert(3)
        >>> sh.top()
        3
        >>> sh.insert(1)
        >>> sh.top()
        1
        >>> sh.insert(3)
        >>> sh.top()
        1
        >>> sh.insert(7)
        >>> sh.top()
        1
        """
        if not self._root:
            raise IndexError("Can't get top element for the empty heap.")
        return self._root.value

    def clear(self) -> None:
        """
        Clear the heap.

        >>> sh = SkewHeap([3, 1, 3, 7])
        >>> sh.clear()
        >>> sh.pop()
        Traceback (most recent call last):
            ...
        IndexError: Can't get top element for the empty heap.
        """
        self._root = None


if __name__ == "__main__":
    import doctest

View on GitHub (pinned to f5988cc097)

Solutions

1. Guard the call: `if sh._root is not None: top = sh.top()`
2. Catch IndexError in drain loops: `try: ... except IndexError: break`
3. Construct with initial data or verify the input iterable was non-empty

Example fix

# before
sh = SkewHeap([])
sh.pop()  # IndexError

# after
sh = SkewHeap([3, 1, 3, 7])
while sh._root:
    print(sh.pop())

top = sh.top() if sh._root is not None else None

while sh._root is not None:
    value = sh.pop()

try:
    top = sh.top()
except IndexError:
    top = None  # empty skew heap

When it happens

Trigger: sh.top()/sh.pop() on a fresh SkewHeap(); after sh.clear() (shown in the doctest); popping more elements than were inserted.

Common situations: Swapping RandomizedHeap for SkewHeap (or vice versa) in code that already handles this error; merge pipelines where one source list was empty; event-loop peeks on a drained heap.

Related errors

• Can't get top element for the empty heap.
• Empty heap
• Binary search tree is empty
• binary tree cannot be empty
• list index out of range.

AI-assisted analysis of TheAlgorithms/Python@f5988cc097 (2026-08-14). Data as JSON: /api/errors/e26e1bcdc1a8f74f. Report an issue: GitHub.