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

build

Browse Source
This commit is contained in:
krahets
2024-04-11 01:11:20 +08:00
parent a6adc8e20a
commit 739f8a31bb
85 changed files with 1555 additions and 979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
en/docs/chapter_tree/binary_tree_traversal.md
View File

@ -305,7 +305,7 @@ Breadth-first traversal is usually implemented with the help of a "queue". The q
val list = mutableListOf<Int>()
while (queue.isNotEmpty()) {
val node = queue.poll() // 队列出队
list.add(node?.value!!) // 保存节点值
list.add(node?._val!!) // 保存节点值
if (node.left != null)
queue.offer(node.left) // 左子节点入队
if (node.right != null)
@ -764,7 +764,7 @@ Depth-first search is usually implemented based on recursion:
fun preOrder(root: TreeNode?) {
if (root == null) return
// 访问优先级：根节点 -> 左子树 -> 右子树
list.add(root.value)
list.add(root._val)
preOrder(root.left)
preOrder(root.right)
}
@ -774,7 +774,7 @@ Depth-first search is usually implemented based on recursion:
if (root == null) return
// 访问优先级：左子树 -> 根节点 -> 右子树
inOrder(root.left)
list.add(root.value)
list.add(root._val)
inOrder(root.right)
}
@ -784,7 +784,7 @@ Depth-first search is usually implemented based on recursion:
// 访问优先级：左子树 -> 右子树 -> 根节点
postOrder(root.left)
postOrder(root.right)
list.add(root.value)
list.add(root._val)
}
```