Python implementation chain list (i)

Simple structure of single linked list, composed of nodes

Node implementation method We use classes to encapsulate

def __init__ (Self,item):    self.item=Item    self.next=none

Here we can refer to the operation of the list when we implement the operation of the linked table

Empty () checks if the length () check is empty () for travel () traversal add (), insert (), append (0 implementation added, add to head operation, insert () to specify the position, append () to implement the team tail operation. Search () Find node

Class Singlelinklist (Object):
def __init__ (self):
Initialization
Self._head=none

def empty (self):
#判断是否为空
Return Self.head==none

def length (self):
#判断长度
C=self._head
Cou=0
While C!=none:
Cou+=1
C=c.next
Return cou

def travel (self):
#遍历
C=self._head
While Cur!=none:
Print C.item
c = C.next

Python implementation chain list (i)