“如何在二叉树中找出与输入整数相等的所有路径”（python）

题目描述：从树的根节点开始往下访问一直到叶子结点经过的所有结点形成一条路径。找到所有的这些路径，使其满足这条路径上所有节点数据的和等于给定的整数。

分析与解答：可以通过对二叉树的遍历找出所有的路径，然后判断各条路径上的所有结点的值的和是否满足给定的整数相等，如果相等，则打印出这条路径。

class BiTNode:
    def __init__(self):
        self.data = None
        self.lchild = None
        self.rchild = None

def FindRoad(root, num, sums, v):
    # 记录当前遍历的root节点
    sums += root.data
    v.append(root.data)
    # 当前节点是叶子节点且遍历的路径上所有节点的和等于num
    if root.lchild == None and root.rchild == None and sums == num:
        i = 0
        while i < len(v):
            print(v[i])
            i += 1
        print('\n')

    # 遍历root的左子树
    if root.lchild != None:
        FindRoad(root.lchild, num, sums, v)
    # 遍历root的右子树
    if root.rchild != None:
        FindRoad(root.rchild, num, sums, v)
    # 清除遍历的路径
    sums -= v[-1]
    v.remove(v[-1])

def constructTree():
    """构建二叉树"""
    root = BiTNode()
    node1 = BiTNode()
    node2 = BiTNode()
    node3 = BiTNode()
    node4 = BiTNode()
    root.data = 6
    node1.data = 3
    node2.data = -7
    node3.data = -1
    node4.data = 9
    root.lchild = node1
    root.rchild = node2
    node1.lchild = node3
    node1.rchild = node4
    node2.lchild = node2.rchild = node3.lchild = node3.rchild = node4.lchild = node4.rchild = None
    return root

if __name__ == "__main__":
    root = constructTree()
    s = []
    pra = print("满足路径结点和等于8的路径为")
    FindRoad(root, 8, 0, s)