单链表实现(python)
来自b站视频
定义
链表是一种线性表,但不想顺序表一样连续存储数据,而是在每一个节点里存放下一个节点的位置信息。
具体代码实现
class Node():
def __init__(self, elem):
self.elem = elem
self.next = None
class SingleLinkList():
def __init__(self, node=None):
self.__head = node
def is_empty(self):
'''判断链表是否为空'''
return self.__head == None
def length(self):
'''计算链表的长度'''
cur = self.__head
count = 0
while cur != None:
count += 1
cur = cur.next
return count
def travel(self):
'''遍历所有的链表'''
cur = self.__head
while cur != None:
print(cur.elem, end=' ')
cur = cur.<