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

Update binary_tree_bfs codes

Browse Source
This commit is contained in:
krahets
2023-02-15 03:36:22 +08:00
parent 8e0080f003
commit 7238c560d1
10 changed files with 19 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/python/chapter_tree/binary_tree_bfs.py
View File

@ -10,7 +10,7 @@ from include import *
""" 层序遍历 """
def hier_order(root: Optional[TreeNode]):
def level_order(root: Optional[TreeNode]):
# 初始化队列，加入根结点
queue = collections.deque()
queue.append(root)
@ -35,6 +35,6 @@ if __name__ == "__main__":
print_tree(root)
# 层序遍历
res = hier_order(root)
res = level_order(root)
print("\n层序遍历的结点打印序列 = ", res)
assert res == [1, 2, 3, 4, 5, 6, 7]