Fundamental Data Structures: T1: Stack Implementation In this task, you will implement a stack data structure in Python. Create a Python class named Stack that will have the following methods: __init__(self): Initialize an empty stack. push(self, item): Push an item onto the stack. pop(self): Pop and return the top item from the stack. If the stack is empty, return an appropriate message. peek(self): Return the top item from the stack without removing it. If the stack is empty, return an appropriate message. is_empty(self): Check if the stack is empty and return True or False. size(self): Return the number of elements in the stack. T 2: Using the Stack In this task, you will use the stack you implemented to solve a common problem: checking if a string containing parentheses, brackets, and curly braces is balanced. Write a Python function is_balanced(expression) that takes a string containing parentheses, brackets, and curly braces and returns True if the symbols are balanced and False otherwise. You can use a stack to help with this task. T 3: Test your Stack Test your stack implementation and the is_balanced function with various test cases to ensure they work correctly. Submission Note: 1. Post the code “is_balanced function”, screenshots of output. Make sure your code is executable.
Fundamental Data Structures:
T1: Stack Implementation In this task, you will implement a stack data structure in Python.
Create a Python class named Stack that will have the following methods:
__init__(self): Initialize an empty stack.
push(self, item): Push an item onto the stack.
pop(self): Pop and return the top item from the stack. If the stack is empty, return an appropriate message.
peek(self): Return the top item from the stack without removing it. If the stack is empty, return an appropriate message.
is_empty(self): Check if the stack is empty and return True or False.
size(self): Return the number of elements in the stack.
T 2: Using the Stack In this task, you will use the stack you implemented to solve a common problem: checking if a string containing parentheses, brackets, and curly braces is balanced.
Write a Python function is_balanced(expression) that takes a string containing parentheses, brackets, and curly braces and returns True if the symbols are balanced and False otherwise.
You can use a stack to help with this task.
T 3: Test your Stack Test your stack implementation and the is_balanced function with various test cases to ensure they work correctly.
Submission Note:
1. Post the code “is_balanced function”, screenshots of output. Make sure your code is executable.
Step by step
Solved in 7 steps with 1 images
