顺序倒序打印链表

顺序倒序打印链表

class node:
    def __init__(self,node=None,next=None):
        self.node=node
        self.next=next

class link:
    def __init__(self,first=None,final=None):
        self.first=first
        self.final=final
        self.first.next=self.final
    def add(self,node):
        
        self.final.next=node
        self.final=node

l=link(node(node='1'),node(node='2'))
l.add(node(node='3'))
l.add(node(node='4'))
l.add(node(node='5'))

#逆序打印
a=[]
b=[]
while l.first:
	#顺序打印
    print(l.first.node)
    a.append(l.first.node)
    l.first=l.first.next
while a:
	#逆序打印
    b.append(a.pop())
print(b)