7-1 求根结点到x结点的路径 (10 分)(Python)
求根结点到x结点的路径(假定结点不重复)。
输入样例:
输入一行字符序列先序递归构建二叉树。每个字符对应一个结点,#表示空结点。第二行输入一个结点值x。
52#3##41##6##
3
结尾无空行
输出样例:
输出从根到结点x的路径。
5 2 3
结尾无空行
class BinNode:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
class BinTree:
def __init__(self, data):
self.root = BinNode(data)
self.trail = []
def preprint(self, r):
if r is None:
return
print(r.data, end="")
self.preprint(r.left)
self.preprint(r.right)
def findx(self, r, x):
if r.data == "#":
return "#"
if r.data == x:
self.trail.append(r.data)
return 1
found = self.findx(r.left, x)
if found != "#":
self.trail.append(r.data)
return 1
else:
foundRight = self.findx(r.right, x)
if foundRight != "#":
self.trail.append(r.data)
return 1
else:
return "#"
inputString = input()
find = input()
tree = BinTree(inputString[0])
def add(r, x, i):
r.left = BinNode(x[i])
if x[i] != "#":
i = add(r.left, x, i + 1)
# 根据填的内容判定是否要继续深入
# 如果是#,则返回上一层
# 不然则继续向左走
i = i + 1
r.right = BinNode(x[i])
if x[i] != "#":
i = add(r.right, x, i + 1)
return i
add(tree.root, inputString, 1)
tree.findx(tree.root, find)
for i in range(len(tree.trail) - 1, -1, -1):
print(tree.trail[i], end=" ")