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

Merge branch 'master' into binary_search_tree

Browse Source
This commit is contained in:
Yudong Jin
2023-01-10 13:30:38 +08:00
committed by GitHub
parent 96d54bff3a a86bdeb7cd
commit daa28be3e4
215 changed files with 5618 additions and 1642 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -98,7 +98,7 @@ function remove(num) {
// 子结点数量 = 2
else {
// 获取中序遍历中 cur 的下一个结点
let nex = min(cur.right);
let nex = getInOrderNext(cur.right);
let tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
@ -108,8 +108,8 @@ function remove(num) {
return cur;
}
/* 获取最小结点 */
function min(root) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
function getInOrderNext(root) {
if (root === null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left !== null) {

4
codes/javascript/chapter_tree/binary_tree_bfs.js
View File

@ -28,10 +28,10 @@ function hierOrder(root) {
/* Driver Code */
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
var root = arrToTree([1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null]);
var root = arrToTree([1, 2, 3, 4, 5, 6, 7]);
console.log("\n初始化二叉树\n");
printTree(root);
/* 层序遍历 */
let list = hierOrder(root);
console.log("\n层序遍历的结点打印序列 = " + list);
console.log("\n层序遍历的结点打印序列 = " + list);

3
codes/javascript/chapter_tree/binary_tree_dfs.js
View File

@ -40,7 +40,7 @@ function postOrder(root) {
/* Driver Code */
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
var root = arrToTree([1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null]);
var root = arrToTree([1, 2, 3, 4, 5, 6, 7]);
console.log("\n初始化二叉树\n");
printTree(root);
@ -58,4 +58,3 @@ console.log("\n中序遍历的结点打印序列 = " + list);
list.length = 0;
postOrder(root);
console.log("\n后序遍历的结点打印序列 = " + list);