Dsa in python
#Using stack in py and in these push and pop the elements:
size=int(input('Enter size of the elemnts:'))
stack=[]
print('Enter elements in stack:')#inserting
for i in range(size):
ele=int(input())
stack.append(ele)
print('Elements are in stack :') #display
for element in stack:
print(element)
rem_v=int(input('Enter the size of elements which are removing:'))
for j in range(rem_v):#pop
stack.pop()
print(f'Remainig elements in stack is : {stack}')
#o/p is:
Enter size of the elemnts:4
Enter elements in stack:
1
2
3
4
Elements are in stack :
1
2
3
4
Enter the size of elements which are removing:1
Remainig elements in stack is : [1, 2, 3]
#Dequeue in py:
from collections import deque
size=int(input('Enter size of the elemnts:'))
stack=deque()
print('Enter elements in stack:')
for i in range(size):
ele=int(input())
stack.append(ele)
print('Elements are in stack :')
for element in stack:
print(element)
rem_v=int(input('Enter the size of elements which are removing:'))
for j in range(rem_v):
stack.pop()
print(f'Remainig elements in stack is : {stack}')
#o/p is:
Enter size of the elemnts:3
Enter elements in stack:
1
2
3
Elements are in stack :
1
2
3
Enter the size of elements which are removing:3
Remainig elements in stack is : deque([])
#using lifoqueue in py:
from queue import LifoQueue
stack=LifoQueue(maxsize=4)
print(stack.qsize())
si=int(input('Enter size of elements:'))
print('Enter elements in stack:')
for i in range(si):
ele=int(input())
stack.put(ele)
print(stack.full())
print(stack.qsize())
rem_v=int(input('Enter the size of elements which are removing:'))
for j in range(rem_v):
stack.get()
print(f'Remainig elements in stack is : {stack.qsize()}')
print(f'Empty:{stack.empty()}')
#o/p is:
Enter size of elements:4
Enter elements in stack:
1
2
3
4
True
4
Enter the size of elements which are removing:4
Remainig elements in stack is : 0
Empty:True
Comments
Post a Comment