OneCompiler

Linear Queue Implementation

224

LinearQueue.png

PYTHON CODE

class LinearQueue:
  
  def __init__(self):
    self.items = []
    
  def enqueue(self,item):
    self.items.append(item)
    
  def is_Empty(self):
    return len(self.items) == 0
  
  def dequeue(self):
    if self.is_Empty():
      return None
    else:
      return self.items.pop(0)
      
  def peek(self):
    if self.is_Empty():
      return None
    else:
      return self.items[0]
      
  def size(self):
    return len(self.items)
      
      
myQueue = LinearQueue()

print(myQueue.is_Empty())
print(myQueue.dequeue())
print(myQueue.peek())
print(myQueue.size())
myQueue.enqueue(0)
myQueue.enqueue(1)
myQueue.enqueue(2)
myQueue.enqueue(3)
myQueue.enqueue(4)
myQueue.enqueue(5)
myQueue.enqueue(6)
print(myQueue.size())
print(myQueue.is_Empty())
print(myQueue.dequeue())
print(myQueue.dequeue())
print(myQueue.dequeue())
print(myQueue.peek())
print(myQueue.size())