归并排序:python实现 两单链表A、B按data值（设为整型）递增有序

• 设两单链表A、B按data值（设为整型）递增有序，设计算法，
  将表A和B合并成一表A，且表A也按data值递增有序

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


class SingleLinkList:
	def __init__(self, node: Node = None):
		self.__head = node

	def is_empty(self):
		"""判断是否为空表"""
		return self.__head is None

	def length(self):
		"""得到表的数据长度"""
		cur = self.__head
		count = 0
		while cur:
			count += 1
			cur = cur.next
		return count

	def travel(self):
		"""遍历链表"""
		cur = self.__head
		while cur:
			print(cur.item, end=' ')
			cur = cur.next
		print()

	def add(self, item):
		"""头部添加元素"""
		node = Node(item)
		node.next = self.__head
		self.__head = node

	def