algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-29 13:23:09 +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

14
docs/chapter_tree/array_representation_of_tree.md
View File

@ -1180,7 +1180,7 @@ comments: true
}
/* 获取索引为 i 节点的值 */
fun value(i: Int): Int? {
fun _val(i: Int): Int? {
// 若索引越界，则返回 null ，代表空位
if (i < 0 || i >= size()) return null
return tree[i]
@ -1206,8 +1206,8 @@ comments: true
val res = mutableListOf<Int?>()
// 直接遍历数组
for (i in 0..<size()) {
if (value(i) != null)
res.add(value(i))
if (_val(i) != null)
res.add(_val(i))
}
return res
}
@ -1215,19 +1215,19 @@ comments: true
/* 深度优先遍历 */
fun dfs(i: Int, order: String, res: MutableList<Int?>) {
// 若为空位，则返回
if (value(i) == null)
if (_val(i) == null)
return
// 前序遍历
if ("pre" == order)
res.add(value(i))
res.add(_val(i))
dfs(left(i), order, res)
// 中序遍历
if ("in" == order)
res.add(value(i))
res.add(_val(i))
dfs(right(i), order, res)
// 后序遍历
if ("post" == order)
res.add(value(i))
res.add(_val(i))
}
/* 前序遍历 */