algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update JavaScript and TypeScript codes for all chapters, rename JavaScript and TypeScript import folder to modules (#402)

Browse Source 
* Update JavaScript and TypeScript codes

* Rename JavaScript and TypeScript import folder to modules
This commit is contained in:
Justin Tse
2023-03-03 01:34:53 +08:00
committed by GitHub
parent 7b41e6c2f0
commit e4a98bc9c5
61 changed files with 324 additions and 290 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
codes/javascript/chapter_tree/binary_tree.js
View File

@@ -4,16 +4,16 @@
* Author: IsChristina (christinaxia77@foxmail.com)
*/
const Tree = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
const { TreeNode } = require("../modules/TreeNode");
const { printTree } = require("../modules/PrintUtil");
/* 初始化二叉树 */
// 初始化结点
let n1 = new Tree.TreeNode(1),
n2 = new Tree.TreeNode(2),
n3 = new Tree.TreeNode(3),
n4 = new Tree.TreeNode(4),
n5 = new Tree.TreeNode(5);
let n1 = new TreeNode(1),
n2 = new TreeNode(2),
n3 = new TreeNode(3),
n4 = new TreeNode(4),
n5 = new TreeNode(5);
// 构建引用指向（即指针）
n1.left = n2;
n1.right = n3;
@@ -23,7 +23,7 @@ console.log("\n初始化二叉树\n");
printTree(n1);
/* 插入与删除结点 */
let P = new Tree.TreeNode(0);
const P = new TreeNode(0);
// 在 n1 -> n2 中间插入结点 P
n1.left = P;
P.left = n2;