Python数据结构

# author：zhangpengxu
#栈
class Stack:
    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def push(self,item):
        self.items.append(item)

    def pop(self):
        return self.item.pop()

    def peek(self):
        return  self.items[len(self.items)-1]

    def size(self):
        return  len(self.items)

#以下为测试，上边代码文件名是zhan，下面引用

# author：zhangpengxu
from zhan import Stack

s=Stack()

print(s.isEmpty())
s.push(4)
s.push('dog')
print (s.peek())
s.push(True)
print (s.size())
print (s.isEmpty())
s.push(8.4)
print(s.pop())