Home Page class 12 @ Python

CBSE Class 12 : Data Structures

Introduction to Data Structures

CBSE Class 12 : Searching

Creation And Traversal
What is Searching?
Linear/Sequential Search
Binary Search
Insertion Of Element
Deletion Of Element

What is sorting?
Bubble Sort
Selection Sort
Insertion Sort

Class 12 Data Structures | Stacks 7

(Maintaing Book details like bcode,btitle and price using stacks)

To maintain book details like bcode, btitle and price using a stack

Operations:
Addition of elements (PUSH)
Deleteion of elements (POP)
Traversal of elements (DISPLAY)

Creation of empty stack

book=[]

Push operation

bcode=input(“Enter bcode “)
btitle=input(“Enter btitle “)
price=input(“Enter price “)
bk=(bcode,btitle,price)
book.append(bk)

Pop operation

if(book==[]):
print(“Underflow / Book Stack in empty”)
else:
bcode,btitle,price=book.pop()
print(“poped element is “)
print(“bcode “,bcode,” btitle “,btitle,” price “,price)

To check stack is empty or not

if(book==[]):
print(“stack is empty”)
else:
print(“stack is not empty”)

Travesal operation

if not (book==[]):
n=len(book)
for i in range(n-1,-1,-1):
print(book[i])
else:
print(“Empty , No book to display”)

Source Code:

```"""
push
pop
traverse
"""
book=[]
def push():
bcode=input("Enter bcode  ")
btitle=input("Enter btitle ")
price=input("Enter price ")
bk=(bcode,btitle,price)
book.append(bk)
def pop():
if(book==[]):
print("Underflow / Book Stack in empty")
else:
bcode,btitle,price=book.pop()
print("poped element is ")
print("bcode ",bcode," btitle ",btitle," price ",price)
def traverse():
if not (book==[]):
n=len(book)
for i in range(n-1,-1,-1):
print(book[i])
else:
print("Empty , No book to display")
while True:
print("1. Push")
print("2. Pop")
print("3. Traversal")
print("4. Exit")
ch=int(input("Enter your choice "))
if(ch==1):
push()
elif(ch==2):
pop()
elif(ch==3):
traverse()
elif(ch==4):
print("End")
break
else:
print("Invalid choice")```

Important Pages