class Node:
def __init__(self, value):
self.value = value
self.left = None
self.right = None
self.left_thread = False
self.right_thread = False
def inorder_threading(node):
if node is not None:
# 确保先访问左子节点
if not node.left_thread:
inorder_threading(node.left)
node.left_thread = True
print(node.value)
# 确保先访问右子节点
if not node.right_thread:
inorder_threading(node.right)
node.right_thread = True
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
root.right.left = Node(6)
root.right.right = Node(7)
# 对左子节点线索化
inorder_threading(root)
python---数据结构---线索二叉树
最新推荐文章于 2024-07-25 22:14:03 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)