CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-07 11:36:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-04-09 20:43:40 +08:00
parent d8caf02e9e
commit a6adc8e20a
48 changed files with 1599 additions and 571 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
docs/chapter_tree/binary_search_tree.md
View File

@@ -299,11 +299,14 @@ comments: true
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 目标节点在 cur 的右子树中
cur = if (cur.value < num) cur.right
cur = if (cur.value < num)
cur.right
// 目标节点在 cur 的左子树中
else if (cur.value > num) cur.left
else if (cur.value > num)
cur.left
// 找到目标节点，跳出循环
else break
else
break
}
// 返回目标节点
return cur
@@ -748,17 +751,22 @@ comments: true
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 找到重复节点，直接返回
if (cur.value == num) return
if (cur.value == num)
return
pre = cur
// 插入位置在 cur 的右子树中
cur = if (cur.value < num) cur.right
cur = if (cur.value < num)
cur.right
// 插入位置在 cur 的左子树中
else cur.left
else
cur.left
}
// 插入节点
val node = TreeNode(num)
if (pre?.value!! < num) pre.right = node
else pre.left = node
if (pre?.value!! < num)
pre.right = node
else
pre.left = node
}
```
@@ -1482,29 +1490,39 @@ comments: true
/* 删除节点 */
fun remove(num: Int) {
// 若树为空，直接提前返回
if (root == null) return
if (root == null)
return
var cur = root
var pre: TreeNode? = null
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 找到待删除节点，跳出循环
if (cur.value == num) break
if (cur.value == num)
break
pre = cur
// 待删除节点在 cur 的右子树中
cur = if (cur.value < num) cur.right
cur = if (cur.value < num)
cur.right
// 待删除节点在 cur 的左子树中
else cur.left
else
cur.left
}
// 若无待删除节点，则直接返回
if (cur == null) return
if (cur == null)
return
// 子节点数量 = 0 or 1
if (cur.left == null || cur.right == null) {
// 当子节点数量 = 0 / 1 时， child = null / 该子节点
val child = if (cur.left != null) cur.left else cur.right
val child = if (cur.left != null)
cur.left
else
cur.right
// 删除节点 cur
if (cur != root) {
if (pre!!.left == cur) pre.left = child
else pre.right = child
if (pre!!.left == cur)
pre.left = child
else
pre.right = child
} else {
// 若删除节点为根节点，则重新指定根节点
root = child