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

Fix binary_search_tree TS code and update JS code style (#715)

Browse Source 
* Fix binary_search_tree TS code

* Update binary_search_tree js code style

* Update binary_search_tree.ts

* Update avl_tree.ts

* Update binary_search_tree.ts

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Justin Tse
2023-09-02 19:56:23 +08:00
committed by GitHub
parent 22d1135e04
commit 89a5f4d0d7
3 changed files with 106 additions and 127 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/javascript/chapter_tree/binary_search_tree.js
View File

@ -56,7 +56,7 @@ class BinarySearchTree {
else cur = cur.left;
}
// 插入节点
let node = new TreeNode(num);
const node = new TreeNode(num);
if (pre.val < num) pre.right = node;
else pre.left = node;
}
@ -82,7 +82,7 @@ class BinarySearchTree {
// 子节点数量 = 0 or 1
if (cur.left === null || cur.right === null) {
// 当子节点数量 = 0 / 1 时， child = null / 该子节点
let child = cur.left !== null ? cur.left : cur.right;
const child = cur.left !== null ? cur.left : cur.right;
// 删除节点 cur
if (cur !== this.root) {
if (pre.left === cur) pre.left = child;
@ -119,7 +119,7 @@ console.log('\n初始化的二叉树为\n');
printTree(bst.getRoot());
/* 查找节点 */
let node = bst.search(7);
const node = bst.search(7);
console.log('\n查找到的节点对象为 ' + node + '，节点值 = ' + node.val);
/* 插入节点 */