CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 02:10:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add build script for JS and TS codes.

Browse Source
This commit is contained in:
krahets
2023-02-08 19:45:06 +08:00
parent 22b7d65d20
commit 05f0054005
28 changed files with 227 additions and 2217 deletions
Download Patch File Download Diff File Expand all files Collapse all files

194
docs/chapter_tree/binary_search_tree.md
View File

@@ -80,42 +80,13 @@ comments: true
=== "JavaScript"
```javascript title="binary_search_tree.js"
/* 查找结点 */
function search(num) {
let cur = root;
// 循环查找，越过叶结点后跳出
while (cur !== null) {
// 目标结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 目标结点在 cur 的左子树中
else if (cur.val > num) cur = cur.left;
// 找到目标结点，跳出循环
else break;
}
// 返回目标结点
return cur;
}
[class]{}-[func]{search}
```
=== "TypeScript"
```typescript title="binary_search_tree.ts"
/* 查找结点 */
function search(num: number): TreeNode | null {
let cur = root;
// 循环查找，越过叶结点后跳出
while (cur !== null) {
if (cur.val < num) {
cur = cur.right; // 目标结点在 cur 的右子树中
} else if (cur.val > num) {
cur = cur.left; // 目标结点在 cur 的左子树中
} else {
break; // 找到目标结点，跳出循环
}
}
// 返回目标结点
return cur;
}
[class]{}-[func]{search}
```
=== "C"
@@ -245,61 +216,13 @@ comments: true
=== "JavaScript"
```javascript title="binary_search_tree.js"
/* 插入结点 */
function insert(num) {
// 若树为空，直接提前返回
if (root === null) return null;
let cur = root, pre = null;
// 循环查找，越过叶结点后跳出
while (cur !== null) {
// 找到重复结点，直接返回
if (cur.val === num) return null;
pre = cur;
// 插入位置在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 插入位置在 cur 的左子树中
else cur = cur.left;
}
// 插入结点 val
let node = new Tree.TreeNode(num);
if (pre.val < num) pre.right = node;
else pre.left = node;
return node;
}
[class]{}-[func]{insert}
```
=== "TypeScript"
```typescript title="binary_search_tree.ts"
/* 插入结点 */
function insert(num: number): TreeNode | null {
// 若树为空，直接提前返回
if (root === null) {
return null;
}
let cur = root,
pre: TreeNode | null = null;
// 循环查找，越过叶结点后跳出
while (cur !== null) {
if (cur.val === num) {
return null; // 找到重复结点，直接返回
}
pre = cur;
if (cur.val < num) {
cur = cur.right as TreeNode; // 插入位置在 cur 的右子树中
} else {
cur = cur.left as TreeNode; // 插入位置在 cur 的左子树中
}
}
// 插入结点 val
let node = new TreeNode(num);
if (pre!.val < num) {
pre!.right = node;
} else {
pre!.left = node;
}
return node;
}
[class]{}-[func]{insert}
```
=== "C"
@@ -518,118 +441,17 @@ comments: true
=== "JavaScript"
```javascript title="binary_search_tree.js"
/* 删除结点 */
function remove(num) {
// 若树为空，直接提前返回
if (root === null) return null;
let cur = root, pre = null;
// 循环查找，越过叶结点后跳出
while (cur !== null) {
// 找到待删除结点，跳出循环
if (cur.val === num) break;
pre = cur;
// 待删除结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 待删除结点在 cur 的左子树中
else cur = cur.left;
}
// 若无待删除结点，则直接返回
if (cur === null) return null;
// 子结点数量 = 0 or 1
if (cur.left === null || cur.right === null) {
// 当子结点数量 = 0 / 1 时， child = null / 该子结点
let child = cur.left !== null ? cur.left : cur.right;
// 删除结点 cur
if (pre.left === cur) pre.left = child;
else pre.right = child;
}
// 子结点数量 = 2
else {
// 获取中序遍历中 cur 的下一个结点
let nex = getInOrderNext(cur.right);
let tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
// 将 nex 的值复制给 cur
cur.val = tmp;
}
return cur;
}
[class]{}-[func]{remove}
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
function getInOrderNext(root) {
if (root === null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left !== null) {
root = root.left;
}
return root;
}
[class]{}-[func]{getInOrderNext}
```
=== "TypeScript"
```typescript title="binary_search_tree.ts"
/* 删除结点 */
function remove(num: number): TreeNode | null {
// 若树为空，直接提前返回
if (root === null) {
return null;
}
let cur = root,
pre: TreeNode | null = null;
// 循环查找，越过叶结点后跳出
while (cur !== null) {
// 找到待删除结点，跳出循环
if (cur.val === num) {
break;
}
pre = cur;
if (cur.val < num) {
cur = cur.right as TreeNode; // 待删除结点在 cur 的右子树中
} else {
cur = cur.left as TreeNode; // 待删除结点在 cur 的左子树中
}
}
// 若无待删除结点，则直接返回
if (cur === null) {
return null;
}
// 子结点数量 = 0 or 1
if (cur.left === null || cur.right === null) {
// 当子结点数量 = 0 / 1 时， child = null / 该子结点
let child = cur.left !== null ? cur.left : cur.right;
// 删除结点 cur
if (pre!.left === cur) {
pre!.left = child;
} else {
pre!.right = child;
}
}
// 子结点数量 = 2
else {
// 获取中序遍历中 cur 的下一个结点
let next = getInOrderNext(cur.right);
let tmp = next!.val;
// 递归删除结点 nex
remove(next!.val);
// 将 nex 的值复制给 cur
cur.val = tmp;
}
return cur;
}
[class]{}-[func]{remove}
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
function getInOrderNext(root: TreeNode | null): TreeNode | null {
if (root === null) {
return null;
}
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left !== null) {
root = root.left;
}
return root;
}
[class]{}-[func]{getInOrderNext}
```
=== "C"