Data Structures | Python - Implement Stack in Python Using Collections and Queue Modules | Python Tutorial | Data Structures

4.0 (0)

17 learners

What you'll learn

This course includes

19.3 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

python stack tutorial stack implementation python python collections module deque python python queue module lifo queue python python stack operations push pop python last in first out LIFO stack python programming tutorial data structures python

Full Transcript

In this video tutorial by Amulya's Academy, we learn how to implement a stack in Python using different modules — specifically, the collections module’s deque class and the queue module’s LifoQueue class. The tutorial explains how stacks follow the LIFO (Last In, First Out) principle and demonstrates stack operations such as push (append/put) and pop (pop/get) using both modules. You’ll also learn how to handle stack limits, check if the stack is empty, and use timeout parameters to manage blocking behavior. This tutorial is a practical guide for Python programmers looking to understand stack implementation beyond simple lists. #DataStructures #PythonPrograms For more free tutorials on computer programming http://www.facebook.com/AmulsAcademy twitter.com/AmulsAcademy