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

Fix naming of the section

Browse Source 
build_binary_tree_problem
This commit is contained in:
krahets
2023-07-17 02:18:53 +08:00
parent a296786b2a
commit f839dc1b0e
18 changed files with 21 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/python/chapter_divide_and_conquer/build_tree.py
View File

@ -18,7 +18,7 @@ def dfs(
l: int,
r: int,
) -> TreeNode | None:
"""构建二叉树 DFS"""
"""构建二叉树：分治"""
# 子树区间为空时终止
if r - l < 0:
return None
@ -26,9 +26,9 @@ def dfs(
root = TreeNode(preorder[i])
# 查询 m ，从而划分左右子树
m = hmap[preorder[i]]
# 递归构建左子树
# 子问题：构建左子树
root.left = dfs(preorder, inorder, hmap, i + 1, l, m - 1)
# 递归构建右子树
# 子问题：构建右子树
root.right = dfs(preorder, inorder, hmap, i + 1 + m - l, m + 1, r)
# 返回根节点
return root