Stack Quick Start

Description

A stack is a linear data structure that follows the Last In, First Out (LIFO) principle. It supports push and pop operations at one end.

Import class

from dsa.stack import Stack  # or the appropriate Stack class

Creation

Create a stack with a default capacity of 10 elements:

s = Stack()

Create a stack with a capacity of 100 elements:

s = Stack(100)

Push element

Push an element into the stack. Raise Exception when trying to push more elements than the capacity.

s.push(10)  # Push 10 onto the stack

Pop element

Pop an element from the stack. Raise Exception when there are no elements to pop.

value = s.pop()  # Pop the top element

Peek element

Return the element from the top of the stack. Raise Exception if stack is empty.

value = s.peek()  # Peek at the top element

Printing Contents

Use print() to print the elements of the stack.

s = Stack()
s.push(1)
s.push(2)
s.push(3)
print(s)

Outputs the following:

[1, 2, 3] Top: 2 Capacity: 10