Method pop

algorithms/stack/ordered_stack.py:66–77

Remove and return the top element. Returns: The top (largest) element. Raises: IndexError: If the stack is empty.

(self)

                self._push_direct(temp_stack.pop())

    def pop(self) -> int:
        """Remove and return the top element.

        Returns:
            The top (largest) element.

        Raises:
            IndexError: If the stack is empty.
        """
        if self.is_empty():
            raise IndexError("Stack is empty")
        return self.items.pop()

    def peek(self) -> int:
        """Return the top element without removing it.