fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update JavaScript style (Chapter of Tree)

Browse Source
This commit is contained in:
justin 2022-12-13 21:32:47 +08:00
parent 58ca52d8ab
commit a171414c7b
4 changed files with 14 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -121,7 +121,7 @@ function min(root) {
/* Driver Code */ /* Driver Code */
/* 初始化二叉搜索树 */ /* 初始化二叉搜索树 */
var nums = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]; var nums = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15];
BinarySearchTree(nums) BinarySearchTree(nums);
console.log("\n初始化的二叉树为\n"); console.log("\n初始化的二叉树为\n");
printTree(getRoot()); printTree(getRoot());

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

@ -19,8 +19,8 @@ n1.left = n2;
n1.right = n3; n1.right = n3;
n2.left = n4; n2.left = n4;
n2.right = n5; n2.right = n5;
console.log("\n初始化二叉树\n") console.log("\n初始化二叉树\n");
printTree(n1) printTree(n1);
/* 插入与删除结点 */ /* 插入与删除结点 */
let P = new Tree.TreeNode(0); let P = new Tree.TreeNode(0);

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

@ -8,7 +8,7 @@ const { arrToTree } = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil"); const { printTree } = require("../include/PrintUtil");
// 初始化列表，用于存储遍历序列 // 初始化列表，用于存储遍历序列
var list = [] var list = [];
/* 前序遍历 */ /* 前序遍历 */
function preOrder(root) { function preOrder(root) {