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/go/chapter_tree/avl_tree.go
View File

@ -195,11 +195,11 @@ func (t *avlTree) search(val int) *TreeNode {
cur := t.root
// 循环查找，越过叶结点后跳出
for cur != nil {
// 目标结点在 root 的右子树中
if cur.Val < val {
// 目标结点在 cur 的右子树中
cur = cur.Right
} else if cur.Val > val {
// 目标结点在 root 的左子树中
// 目标结点在 cur 的左子树中
cur = cur.Left
} else {
// 找到目标结点，跳出循环

4
codes/go/chapter_tree/binary_search_tree.go
View File

@ -46,10 +46,10 @@ func (bst *binarySearchTree) search(num int) *TreeNode {
// 循环查找，越过叶结点后跳出
for node != nil {
if node.Val < num {
// 目标结点在 root 的右子树中
// 目标结点在 cur 的右子树中
node = node.Right
} else if node.Val > num {
// 目标结点在 root 的左子树中
// 目标结点在 cur 的左子树中
node = node.Left
} else {
// 找到目标结点，跳出循环