-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue-linked-list.py
42 lines (37 loc) · 1.12 KB
/
queue-linked-list.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
class Node:
def __init__(self, data=None, nex=None):
self.data = data
self.nex = nex
class Queue:
def __init__(self, data=None):
if data is None:
# inserting from tail and removing from head
self.head = None
self.tail =None
else:
new_node = Node(data)
self.head = new_node
self.tail = new_node
def travel(self):
temp = self.head
while temp is not None:
print(temp.data)
temp = temp.nex
def enqueue(self, data):
new_node = Node(data)
if (self.tail is None) and (self.head is None):
# when queue/linked-list is empty
self.head = new_node
self.tail = new_node
else:
self.tail.nex = new_node
self.tail = new_node
def dequeue(self):
if (self.tail is None) and (self.head is None):
# when queue/linked-list is empty
return
ret = self.head.data
if self.head == self.tail:
self.tail = None
self.head = self.head.nex
return ret