栈的链式存储

class Node:
    def __init__(self,data=None):
        self.data=data
        self.next=None
class Linkstack:
    def __init__(self):
        self.top=None
        self.size=0
    #入栈
    def push(self,data):
        new_node=Node(data)
        if self.top is not None:
            new_node.next=self.top
        self.top=new_node
        self.size+=1
    #出栈
    def pop(self):
        if self.is_empty():
            return None
        else:
            poped=self.top
            self.top=self.top.next
            poped.next=None
            self.size=-1
            return poped.data
    def peek(self):
        if self.is_empty():
            return None
        else:
            return self.top.data
    #判断栈是否为空
    def is_empty(self):
        return self.size==0
    #栈的大小
    def get_size(self):
        return self.size
stack=Linkstack()
stack.push(10)
stack.push(20)
stack.push(30)

stack.push('任继超1')
stack.push('任继超2')
stack.push('任继超3')
print(stack.get_size())
print(stack.pop())
print(stack.peek())