/
githubmirror
/
hello-algo
Обзор
Документация
Войти
/
githubmirror
/
hello-algo
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
codes/python/chapter_tree/binary_tree_dfs.py
65 строк
2 KB
krahets
Improve Python code for importing modules.
19 окт 2023, 11:21
19 окт 2023, 11:21
5aacf2d
Код
Авторство
О чём код?
""" File: binary_tree_dfs.py Created Time: 2022-12-20 Author: a16su (lpluls001@gmail.com) """ import sys from pathlib import Path sys.path.append(str(Path(__file__).parent.parent)) from modules import TreeNode, list_to_tree, print_tree def pre_order(root: TreeNode | None): """前序遍历""" if root is None: return # 访问优先级：根节点 -> 左子树 -> 右子树 res.append(root.val) pre_order(root=root.left) pre_order(root=root.right) def in_order(root: TreeNode | None): """中序遍历""" if root is None: return # 访问优先级：左子树 -> 根节点 -> 右子树 in_order(root=root.left) res.append(root.val) in_order(root=root.right) def post_order(root: TreeNode | None): """后序遍历""" if root is None: return # 访问优先级：左子树 -> 右子树 -> 根节点 post_order(root=root.left) post_order(root=root.right) res.append(root.val) """Driver Code""" if __name__ == "__main__": # 初始化二叉树 # 这里借助了一个从数组直接生成二叉树的函数 root = list_to_tree(arr=[1, 2, 3, 4, 5, 6, 7]) print("\n初始化二叉树\n") print_tree(root) # 前序遍历 res = [] pre_order(root) print("\n前序遍历的节点打印序列 = ", res) # 中序遍历 res.clear() in_order(root) print("\n中序遍历的节点打印序列 = ", res) # 后序遍历 res.clear() post_order(root) print("\n后序遍历的节点打印序列 = ", res)