单链表建立链表的代码 数据结构
时间: 2024-09-28 21:02:55 浏览: 18
单链表是一种线性的数据结构,其中的元素通过指针链接在一起。创建单链表通常涉及以下几个步骤:
```python
class Node:
def __init__(self, data=None):
self.data = data
self.next = None
# 创建空链表
def create_empty_list():
return None
# 在链表末尾添加节点
def append_to_list(head, new_data):
if head is None: # 如果链表为空
head = Node(new_data) # 新建节点并设为头节点
else:
current_node = head
while current_node.next is not None:
current_node = current_node.next
current_node.next = Node(new_data) # 将新节点添加到尾部
return head
# 在指定位置插入节点
def insert_at_position(head, position, data):
if position <= 0:
print("Invalid position")
return head
current_node = head
for _ in range(position - 1):
if current_node is None:
return None
current_node = current_node.next
new_node = Node(data)
new_node.next = current_node.next
current_node.next = new_node
return head
# 打印链表(假设有一个名为`print_list`的辅助函数)
def print_list(head):
current_node = head
while current_node:
print(current_node.data, end=" -> ")
current_node = current_node.next
print("None")
# 示例:
head = create_empty_list()
head = append_to_list(head, 1)
head = append_to_list(head, 2)
head = insert_at_position(head, 1, 3)
print_list(head) # 输出: 1 -> 3 -> 2 -> None
```
阅读全文