xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-14 12:40:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(Kotlin): Replace value with _val (#1254)

Browse Source 
* ci(kotlin): Add workflow file.

* Update kotlin.yml

* style(kotlin): value -> _val

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
curtishd
2024-04-10 18:09:43 +08:00
committed by GitHub
parent 39e2e1a5c1
commit 1623e3c6a8
28 changed files with 152 additions and 152 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/kotlin/chapter_tree/binary_search_tree.kt
+10 -10
View File
@@ -25,10 +25,10 @@ class BinarySearchTree {
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 目标节点在 cur 的右子树中
cur = if (cur.value < num)
cur = if (cur._val < num)
cur.right
// 目标节点在 cur 的左子树中
else if (cur.value > num)
else if (cur._val > num)
cur.left
// 找到目标节点，跳出循环
else
@@ -50,11 +50,11 @@ class BinarySearchTree {
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 找到重复节点，直接返回
if (cur.value == num)
if (cur._val == num)
return
pre = cur
// 插入位置在 cur 的右子树中
cur = if (cur.value < num)
cur = if (cur._val < num)
cur.right
// 插入位置在 cur 的左子树中
else
@@ -62,7 +62,7 @@ class BinarySearchTree {
}
// 插入节点
val node = TreeNode(num)
if (pre?.value!! < num)
if (pre?._val!! < num)
pre.right = node
else
pre.left = node
@@ -78,11 +78,11 @@ class BinarySearchTree {
// 循环查找，越过叶节点后跳出
while (cur != null) {
// 找到待删除节点，跳出循环
if (cur.value == num)
if (cur._val == num)
break
pre = cur
// 待删除节点在 cur 的右子树中
cur = if (cur.value < num)
cur = if (cur._val < num)
cur.right
// 待删除节点在 cur 的左子树中
else
@@ -116,9 +116,9 @@ class BinarySearchTree {
tmp = tmp.left
}
// 递归删除节点 tmp
remove(tmp.value)
remove(tmp._val)
// 用 tmp 覆盖 cur
cur.value = tmp.value
cur._val = tmp._val
}
}
}
@@ -137,7 +137,7 @@ fun main() {
/* 查找节点 */
val node = bst.search(7)
println("查找到的节点对象为 $node，节点值 = ${node?.value}")
println("查找到的节点对象为 $node，节点值 = ${node?._val}")
/* 插入节点 */
bst.insert(16)