Queues built from lists 

[cc lang=”python”]
# initialize queue as a list
queue1 = []

# queue is linear structure with defined rule first in firt out (FIFO)
queue1.append(“first element”)
queue1.append(“second element”)
queue1.append(“third element”)
print(queue1)

# get first element from the queue
elem = queue1.pop(0)
print(elem)
print(queue1)

# get next first element from the queue
elem = queue1.pop(0)
print(elem)
print(queue1)
[/cc]

Queues built from deque collection

[cc lang=”python”]
from collections import deque

# initialize queue
queue1 = deque()

# queue is linear structure with defined rule first in firt out (FIFO)
queue1.append(“first element”)
queue1.append(“second element”)
queue1.append(“third element”)
print(queue1)

# get first element from the queue
elem = queue1.popleft()
print(elem)
print(queue1)

# get next first element from the queue
elem = queue1.popleft()
print(elem)
print(queue1)
[/cc]

Queues built from from queues

[cc lang=”python” height=”580px”]
from queue import Queue

# initialize queue
queue1 = Queue(maxsize = 4)

# queue is linear structure with defined rule first in firt out (FIFO)
queue1.put(“first element”)
queue1.put(“second element”)
queue1.put(“third element”)
queue1.put(“fourth element”)
print(queue1)

# get first element from the queue
elem = queue1.get()
print(elem)
print(queue1)

# get next first element from the queue
elem = queue1.get()
print(elem)
print(queue1)

# current number of elements in a queue
print( queue1.qsize())

# maximum size of elements in a queue
print( queue1.maxsize)

# check if queue1 is empty
print( queue1.empty() )

# check if queue1 is full
print( queue1.full() )
[/cc]