Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Understand and apply algorithms
·
Module 7
Linear Data Structures
1
Stacks: LIFO Principles and Python Implementation
Describe the stack data structure (LIFO) and implement one using a Python list.
2
Stack Applications: Parentheses Balancing
Solve a problem using a stack, such as checking for balanced parentheses.
3
Queues with `collections.deque`
Describe the queue data structure (FIFO) and implement one using `collections.deque`.
4
Node Class and Singly Linked List Implementation
Define a Node class and implement a basic singly linked list.
5
Singly Linked List: Insertion and Deletion
Implement insertion and deletion operations for a singly linked list.
6
Linked List vs. Array: Time Complexity Analysis
Analyze the time complexity of linked list operations versus list/array operations.
Previous module
Searching and Sorting Algorithms
Next module
Hash Tables