-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathdeque.py
88 lines (72 loc) · 2.38 KB
/
deque.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
# Copyright (C) Deepali Srivastava - All Rights Reserved
# This code is part of DSA course available on CourseGalaxy.com
class EmptyQueueError(Exception):
pass
class Deque:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def size(self):
return len(self.items)
def insert_front(self, item):
self.items.insert(0,item)
def insert_rear(self, item):
self.items.append(item)
def delete_front(self):
if self.is_empty():
raise EmptyQueueError("Queue is Empty")
return self.items.pop(0)
def delete_rear(self):
if self.is_empty():
raise EmptyQueueError("Queue is Empty")
return self.items.pop()
def first(self):
if self.is_empty():
raise EmptyQueueError("Queue is Empty")
return self.items[0]
def last(self):
if self.is_empty():
raise EmptyQueueError("Queue is Empty")
return self.items[-1]
def display(self):
print(self.items)
####################################################################
if __name__ == "__main__":
qu = Deque()
while True:
print("1.Insert at the front end")
print("2.Insert at the rear end")
print("3.Delete from front end")
print("4.Delete from rear end")
print("5.Display first element")
print("6.Display last element")
print("7.Display")
print("8.Size")
print("9.Quit")
choice = int(input("Enter your choice : "))
if choice == 1:
x=int(input("Enter the element : "))
qu.insert_front(x)
elif choice== 2:
x=int(input("Enter the element : "))
qu.insert_rear(x)
elif choice == 3:
x = qu.delete_front()
print("Element deleted from front end is ", x)
elif choice == 4:
x = qu.delete_rear()
print("Element deleted from rear end is ", x)
elif choice == 5:
print("First element is ", qu.first())
elif choice == 6:
print("Last element is ", qu.last())
elif choice == 7:
qu.display()
elif choice == 8:
print("Size of queue " , qu.size())
elif choice == 9:
break
else:
print("Wrong choice")
print()