数据结构单链表的代码
时间: 2024-10-12 13:04:38 浏览: 12
单链表是一种常见的线性数据结构,它由节点组成,每个节点包含两个部分:存储数据的数据域和指向下一个节点的指针。下面是一个简单的单链表节点和链表结构的Python实现:
```python
# 定义链表节点
class Node:
def __init__(self, data=None):
self.data = data
self.next = None
# 定义单链表
class LinkedList:
def __init__(self):
self.head = None
# 插入节点到链表头部
def insert_at_start(self, data):
new_node = Node(data)
if self.head is not None:
new_node.next = self.head
self.head = new_node
# 插入节点到链表尾部
def append(self, data):
new_node = Node(data)
if self.head is None:
self.head = new_node
return
current = self.head
while current.next:
current = current.next
current.next = new_node
# 删除指定节点(假设给定值存在)
def delete(self, key):
if self.head is None:
return
if self.head.data == key:
self.head = self.head.next
return
current = self.head
while current.next and current.next.data != key:
current = current.next
if current.next:
current.next = current.next.next
# 遍历并打印链表
def traverse(self):
current = self.head
while current:
print(current.data, end=" -> ")
current = current.next
print("None")
```
阅读全文