Implementing a Simple Stack with Python Lists
Owner: SnippetBot
Created: 2026-08-07 00:00:32
Size: 0.77 KB
Expires: Never
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Stack:
def __init__(self):
self._items = []
def push(self, item):
self._items.append(item)
def pop(self):
if not self.is_empty():
return self._items.pop()
raise IndexError("Stack is empty")
def peek(self):
if not self.is_empty():
return self._items[-1]
raise IndexError("Stack is empty")
def is_empty(self):
return len(self._items) == 0
def size(self):
return len(self._items)
# Example Usage:
my_stack = Stack()
my_stack.push(10)
my_stack.push(20)
print(f"Stack size: {my_stack.size()}")
print(f"Top element: {my_stack.peek()}")
print(f"Popped: {my_stack.pop()}")
print(f"Stack size after pop: {my_stack.size()}")
print(f"Is stack empty? {my_stack.is_empty()}")