Python: Stack class

class Stack():
    def __init__(self, size):
        self.stack = []
        self.size = size
        self.top = -1

    def push(self, content):
        if self.isFull():
            print "Stack is full"
        else:
            self.stack.append(content)
            self.top += 1

    def pop(self):
        if self.isEmpty():
            print "Stack is empty"
        else:
            self.stack.pop()
            self.top -= 1

    def isFull(self):
        if self.top + 1 == self.size:
            return True
        else:
            return False

    def isEmpty(self):
        if self.top == -1:
            return True
        else:
            return False

def printStackInfo(aStack):
    print "isEmpty:	{0}".format(aStack.isEmpty())
    print "isFull:		{0}".format(aStack.isFull())
    print "top:		{0}".format(aStack.top)
    print "stack:		{0}".format(aStack.stack)

print "1. Initialise a stack with a size of 2, i.e. store at most 2 elements"
s = Stack(2)
printStackInfo(s)

print "
2. Push 'a'"
s.push('a')
printStackInfo(s)

print "
3. push 'b'"
s.push('b')
printStackInfo(s)

print "
4. push 'c'"
s.push('c')
printStackInfo(s)

print "
5. pop the top element"
s.pop()
printStackInfo(s)

print "
6. pop the top element"
s.pop()
printStackInfo(s)

print "
7. pop the top element"
s.pop()
printStackInfo(s)