# 前序遍历
def forwardsort(data):
if data is None:
return None
print(data.data)
forwardsort(data.left)
forwardsort(data.right)
# 中序遍历
def Msort(data):
if data is None:
return None
Msort(data.left)
print(data.data)
Msort(data.right)
# 后序遍历
def Bsort(data):
if data is None:
return None
Bsort(data.left)
Bsort(data.right)
print(data.data)
# 判断某数是否在树内
def BST(node, target):
if node is None:
return False
if target < node.data:
BST(node.left, target)
elif target > node.data:
BST(node.right, target)
else:
True
【python--数据结构】 树
最新推荐文章于 2024-01-08 08:00:00 发布