【链表的实现及操作】Python版本

Class Node(object):
   def __init__(self, data = None, Next = None):
       self.data = data
       self.next = next

Class ListNode(object):

   def __init__(self):
       self.head = None
   

   // 顺序输出链表
   def ListPrint(self):
       printval = self.head
       while printval is not None:
           print(printval.data)
           printval = printval.next
   
   
   // 判断链表是否为空
   def is_empty(self):
       return self.head is None

list = SlinkedList()
// 头节点
list.head = Node("")
list.ListPrint()