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

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/swift/chapter_tree/binary_tree_dfs.swift
View File

@ -14,7 +14,7 @@ func preOrder(root: TreeNode?) {
guard let root = root else {
return
}
// 访问优先级：根结点 -> 左子树 -> 右子树
// 访问优先级：根节点 -> 左子树 -> 右子树
list.append(root.val)
preOrder(root: root.left)
preOrder(root: root.right)
@ -25,7 +25,7 @@ func inOrder(root: TreeNode?) {
guard let root = root else {
return
}
// 访问优先级：左子树 -> 根结点 -> 右子树
// 访问优先级：左子树 -> 根节点 -> 右子树
inOrder(root: root.left)
list.append(root.val)
inOrder(root: root.right)
@ -36,7 +36,7 @@ func postOrder(root: TreeNode?) {
guard let root = root else {
return
}
// 访问优先级：左子树 -> 右子树 -> 根结点
// 访问优先级：左子树 -> 右子树 -> 根节点
postOrder(root: root.left)
postOrder(root: root.right)
list.append(root.val)
@ -55,16 +55,16 @@ enum BinaryTreeDFS {
/* 前序遍历 */
list.removeAll()
preOrder(root: root)
print("\n前序遍历的结点打印序列 = \(list)")
print("\n前序遍历的节点打印序列 = \(list)")
/* 中序遍历 */
list.removeAll()
inOrder(root: root)
print("\n中序遍历的结点打印序列 = \(list)")
print("\n中序遍历的节点打印序列 = \(list)")
/* 后序遍历 */
list.removeAll()
postOrder(root: root)
print("\n后序遍历的结点打印序列 = \(list)")
print("\n后序遍历的节点打印序列 = \(list)")
}
}