algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the comments in

Browse Source 
binary_search_tree and avl_tree.
This commit is contained in:
Yudong Jin
2023-01-17 01:53:12 +08:00
parent 8e2e95a511
commit 2336fe1d50
14 changed files with 70 additions and 68 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/java/chapter_tree/avl_tree.java
View File

@ -165,10 +165,10 @@ class AVLTree {
TreeNode cur = root;
// 循环查找，越过叶结点后跳出
while (cur != null) {
// 目标结点在 root 的右子树中
// 目标结点在 cur 的右子树中
if (cur.val < val)
cur = cur.right;
// 目标结点在 root 的左子树中
// 目标结点在 cur 的左子树中
else if (cur.val > val)
cur = cur.left;
// 找到目标结点，跳出循环

8
codes/java/chapter_tree/binary_search_tree.java
View File

@ -40,9 +40,9 @@ class BinarySearchTree {
TreeNode cur = root;
// 循环查找，越过叶结点后跳出
while (cur != null) {
// 目标结点在 root 的右子树中
// 目标结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 目标结点在 root 的左子树中
// 目标结点在 cur 的左子树中
else if (cur.val > num) cur = cur.left;
// 找到目标结点，跳出循环
else break;
@ -61,9 +61,9 @@ class BinarySearchTree {
// 找到重复结点，直接返回
if (cur.val == num) return null;
pre = cur;
// 插入位置在 root 的右子树中
// 插入位置在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 插入位置在 root 的左子树中
// 插入位置在 cur 的左子树中
else cur = cur.left;
}
// 插入结点 val