algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix the code of preorder_traversal_iii_compact

Browse Source
This commit is contained in:
krahets
2023-07-21 22:08:26 +08:00
parent 075c3abf88
commit bba62bbe75
11 changed files with 19 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
codes/python/chapter_backtracking/preorder_traversal_iii_compact.py
View File

@ -20,6 +20,7 @@ def pre_order(root: TreeNode) -> None:
if root.val == 7:
# 记录解
res.append(list(path))
path.pop()
return
pre_order(root.left)
pre_order(root.right)
@ -38,6 +39,6 @@ if __name__ == "__main__":
res = list[list[TreeNode]]()
pre_order(root)
print("\n输出所有根节点到节点 7 的路径，且路径中不包含值为 3 的节点")
print("\n输出所有根节点到节点 7 的路径，路径中不包含值为 3 的节点，仅包含一个值为 7 的节点")
for path in res:
print([node.val for node in path])