Data-Structures-using-Python/Queue/Queue.py at master · OmkarPathak/Data-Structures-using-Python · GitHub

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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())
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
# Author: OMKAR PATHAK

classQueue(object):
def__init__(self, limit=10):
self.queue= []
self.front=None
self.rear=None
self.limit=limit
self.size=0

def__str__(self):
return' '.join([str(i) foriinself.queue])

# to check if queue is empty
defisEmpty(self):
returnself.size<=0

# to add an element from the rear end of the queue
defenqueue(self, data):
ifself.size>=self.limit:
return-1# queue overflow
else:
self.queue.append(data)

# assign the rear as size of the queue and front as 0
ifself.frontisNone:
self.front=self.rear=0
else:
self.rear=self.size

self.size+=1

# to pop an element from the front end of the queue
defdequeue(self):
ifself.isEmpty():
return-1# queue underflow
else:
self.queue.pop(0)
self.size-=1
ifself.size==0:
self.front=self.rear=0
else:
self.rear=self.size-1

defgetSize(self):
returnself.size

if__name__=='__main__':
myQueue=Queue()
foriinrange(10):
myQueue.enqueue(i)
print(myQueue)
print('Queue Size:',myQueue.getSize())
myQueue.dequeue()
print(myQueue)
print('Queue Size:',myQueue.getSize())