单链表的数据结构代码
时间: 2024-10-21 18:00:34 浏览: 1
单链表通常由四个基本元素组成:数据域(data)、指针域(next),以及头结点(head)和尾节点(tail)。这里是一个简单的单链表节点的Python伪代码示例:
```python
class Node:
def __init__(self, data=None):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.head = None
self.tail = None
# 插入节点到链表头部
def insert_at_beginning(self, data):
new_node = Node(data)
if not self.head:
self.head = new_node
self.tail = new_node
else:
new_node.next = self.head
self.head = new_node
# 插入节点到链表尾部
def insert_at_end(self, data):
new_node = Node(data)
if not self.head:
self.head = new_node
self.tail = new_node
else:
self.tail.next = new_node
self.tail = new_node
# 删除节点
def delete(self, key):
current = self.head
if current and current.data == key:
self.head = current.next
if not self.head:
self.tail = None
return
prev = None
while current and current.data != key:
prev = current
current = current.next
if current is None:
return
prev.next = current.next
if current == self.tail:
self.tail = prev
# 遍历链表
def traverse(self):
current = self.head
while current:
print(current.data)
current = current.next
```
以上代码展示了单链表的基本操作,包括创建节点、插入节点、删除节点和遍历链表。注意,在实际应用中,链表可能会有更复杂的操作,例如查找特定节点等。
阅读全文