algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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/swift/chapter_tree/binary_tree_bfs.swift
View File

@ -7,7 +7,7 @@
import utils
/* 层序遍历 */
func hierOrder(root: TreeNode) -> [Int] {
func levelOrder(root: TreeNode) -> [Int] {
// 初始化队列，加入根结点
var queue: [TreeNode] = [root]
// 初始化一个列表，用于保存遍历序列
@ -36,7 +36,7 @@ enum BinaryTreeBFS {
PrintUtil.printTree(root: node)
/* 层序遍历 */
let list = hierOrder(root: node)
let list = levelOrder(root: node)
print("\n层序遍历的结点打印序列 = \(list)")
}
}