algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-12 01:51:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format python codes with black. (#453)

Browse Source
This commit is contained in:
Yudong Jin
2023-04-09 05:05:35 +08:00
committed by GitHub
parent 1c8b7ef559
commit 5ddcb60825
45 changed files with 656 additions and 456 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
codes/python/chapter_tree/binary_tree_dfs.py
View File

@ -5,11 +5,13 @@ Author: a16su (lpluls001@gmail.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def pre_order(root: TreeNode | None) -> None:
""" 前序遍历 """
"""前序遍历"""
if root is None:
return
# 访问优先级：根节点 -> 左子树 -> 右子树
@ -17,8 +19,9 @@ def pre_order(root: TreeNode | None) -> None:
pre_order(root=root.left)
pre_order(root=root.right)
def in_order(root: TreeNode | None) -> None:
""" 中序遍历 """
"""中序遍历"""
if root is None:
return
# 访问优先级：左子树 -> 根节点 -> 右子树
@ -26,8 +29,9 @@ def in_order(root: TreeNode | None) -> None:
res.append(root.val)
in_order(root=root.right)
def post_order(root: TreeNode | None) -> None:
""" 后序遍历 """
"""后序遍历"""
if root is None:
return
# 访问优先级：左子树 -> 右子树 -> 根节点