Python: Queue class

class Queue():
def __init__(self, size):
self.queue = []
self.size = size
self.head = 0
self.tail = 0

def isEmpty(self):
if self.head == self.tail:
return True
else:
return False

def isFull(self):
if self.tail - self.head == self.size:
return True
else:
return False

def inQueue(self, content):
if self.isFull():
print "Queue is full"
else:
self.queue.append(content)
self.tail += 1

def outQueue(self):
if self.isEmpty():
print "Queue is empty"
else:
self.queue.remove(self.queue[0])
self.tail -= 1

def printQueueInfo(aQueue):
print "isEmpty:\t{0}".format(aQueue.isEmpty())
print "isFull:\t\t{0}".format(aQueue.isFull())
print "head:\t\t{0}".format(aQueue.head)
print "tail:\t\t{0}".format(aQueue.tail)
print "queue:\t\t{0}".format(aQueue.queue)

print "1. Initialise a stack with a size of 2, i.e. store at most 2 elements"
q = Queue(2)
printQueueInfo(q)

print "\n2. Add 'a'"
q.inQueue('a')
printQueueInfo(q)

print "\n3. Add 'b'"
q.inQueue('b')
printQueueInfo(q)

print "\n4. Remove 'a'"
q.outQueue()
printQueueInfo(q)

print "\n5. Add 'c'"
q.inQueue('c')
printQueueInfo(q)