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

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

@ -11,7 +11,7 @@ const { printTree } = require("../include/PrintUtil");
var root; var root;
function BinarySearchTree(nums) { function BinarySearchTree(nums) {
nums.sort((a,b) => { return a-b }); // 排序数组 nums.sort((a, b) => { return a - b }); // 排序数组
root = buildTree(nums, 0, nums.length - 1); // 构建二叉搜索树 root = buildTree(nums, 0, nums.length - 1); // 构建二叉搜索树
} }
@ -120,8 +120,8 @@ 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());

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

@ -10,17 +10,17 @@ const { printTree } = require("../include/PrintUtil");
/* 初始化二叉树 */ /* 初始化二叉树 */
// 初始化结点 // 初始化结点
let n1 = new Tree.TreeNode(1), let n1 = new Tree.TreeNode(1),
n2 = new Tree.TreeNode(2), n2 = new Tree.TreeNode(2),
n3 = new Tree.TreeNode(3), n3 = new Tree.TreeNode(3),
n4 = new Tree.TreeNode(4), n4 = new Tree.TreeNode(4),
n5 = new Tree.TreeNode(5); n5 = new Tree.TreeNode(5);
// 构建引用指向（即指针） // 构建引用指向（即指针）
n1.left = n2; 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);

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

@ -20,7 +20,7 @@ function hierOrder(root) {
queue.push(node.left); // 左子结点入队 queue.push(node.left); // 左子结点入队
if (node.right) if (node.right)
queue.push(node.right); // 右子结点入队 queue.push(node.right); // 右子结点入队
} }
return list; return list;
} }
@ -28,7 +28,7 @@ function hierOrder(root) {
/* Driver Code */ /* 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, null, null, null, null, null, null, null, null]);
console.log("\n初始化二叉树\n"); console.log("\n初始化二叉树\n");
printTree(root); printTree(root);

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

@ -8,16 +8,16 @@ 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) {
if (root === null) return; if (root === null) return;
// 访问优先级：根结点 -> 左子树 -> 右子树 // 访问优先级：根结点 -> 左子树 -> 右子树
list.push(root.val); list.push(root.val);
preOrder(root.left); preOrder(root.left);
preOrder(root.right); preOrder(root.right);
} }
/* 中序遍历 */ /* 中序遍历 */
function inOrder(root) { function inOrder(root) {