python 链表的创建和插入

 （1）链表的创建

#（1） 没有head节点   缺点：需要每次验证是否为空
# class node:
# 	def __init__(self,data):
# 		self.data = data
# 		self.next = None

# a = node(1)
# b = node(2)
# v = node
# c = node(3)
# a.next = v
# v.next = b
# b.next = c
# print(a.next)



#（2）有head  缺点：head占一个空间   优点：不需要验证是否为空

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

# head = node()
# a = node(1)
# b = node(2)
# c = node(3)
# head.next = a
# a.next = b.next = c
# print(b.next.data)

 

（2）链表的插入

首插法

尾插法 

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

class LinkList():
	def __init__(self,li,method='head'):
		self.head = None
		self.tail = None
		if method == 'head':
			s