Download to read offline
![ stack = [] # Push elements stack.append(10) stack.append(20) stack.append(30) # Pop elements print(stack.pop()) # Output: 30 print(stack.pop()) # Output: 20 # Stack after popping print(stack) # Output: [10]](https://image.slidesharecdn.com/stack-250227164845-372ca04d/75/stack-in-python-using-different-datatypes-pptx-7-2048.jpg)
Uploaded byurvashipundir04
PPTX, PDF61 views
stack in python using different datatypes.pptx
stack in python using different datatypes.pptx
More Related Content
Similar to stack in python using different datatypes.pptx
More from urvashipundir04
Recently uploaded
stack in python using different datatypes.pptx
- 2. INTRODUCTION A stackis a linear data structure that stores items in a Last-In/First-Out (LIFO) or First-In/Last-Out (FILO) manner. In stack, a new element is added at one end and an element is removed from that end only. The insert and delete operations are often called push and pop. Instead of push(), append() is used to add elements to the top of the stack while pop() removes the element in LIFO order.
- 4. The functions associatedwith stack are: empty() – Returns whether the stack is empty – Time Complexity: O(1) size() – Returns the size of the stack – Time Complexity: O(1) top() / peek() – Returns a reference to the topmost element of the stack – Time Complexity: O(1) push(a) – Inserts the element ‘a’ at the top of the stack – Time Complexity: O(1) pop() – Deletes the topmost element of the stack – Time Complexity: O(1)
- 5.
- 6. IMPLEMENTATION There arevarious ways from which a stack can be implemented in Python. Stack in Python can be implemented using the following ways: list Collections.deque queue.LifoQueue
- 7. stack =[] # Push elements stack.append(10) stack.append(20) stack.append(30) # Pop elements print(stack.pop()) # Output: 30 print(stack.pop()) # Output: 20 # Stack after popping print(stack) # Output: [10]