Merge pull request #104 from justin-tse/dev

Fix the PrintUtil.js showTrunks and Update JavaScript and docs' style (Chapter of Tree)
This commit is contained in:
Yudong Jin 2022-12-13 22:55:02 +08:00 committed by GitHub
commit 4289aa3c8f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
7 changed files with 26 additions and 26 deletions

View file

@ -11,7 +11,7 @@ const { printTree } = require("../include/PrintUtil");
var root;
function BinarySearchTree(nums) {
nums.sort((a,b) => { return a-b }); // 排序数组
nums.sort((a, b) => { return a - b }); // 排序数组
root = buildTree(nums, 0, nums.length - 1); // 构建二叉搜索树
}
@ -120,8 +120,8 @@ function min(root) {
/* Driver Code */
/* 初始化二叉搜索树 */
var nums = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ];
BinarySearchTree(nums)
var nums = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15];
BinarySearchTree(nums);
console.log("\n初始化的二叉树为\n");
printTree(getRoot());

View file

@ -10,17 +10,17 @@ const { printTree } = require("../include/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);
n2 = new Tree.TreeNode(2),
n3 = new Tree.TreeNode(3),
n4 = new Tree.TreeNode(4),
n5 = new Tree.TreeNode(5);
// 构建引用指向(即指针)
n1.left = n2;
n1.right = n3;
n2.left = n4;
n2.right = n5;
console.log("\n初始化二叉树\n")
printTree(n1)
console.log("\n初始化二叉树\n");
printTree(n1);
/* 插入与删除结点 */
let P = new Tree.TreeNode(0);

View file

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

View file

@ -8,16 +8,16 @@ const { arrToTree } = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
// 初始化列表,用于存储遍历序列
var list = []
var list = [];
/* 前序遍历 */
function preOrder(root){
function preOrder(root) {
if (root === null) return;
// 访问优先级:根结点 -> 左子树 -> 右子树
list.push(root.val);
preOrder(root.left);
preOrder(root.right);
}
}
/* 中序遍历 */
function inOrder(root) {

View file

@ -79,10 +79,10 @@ function showTrunks(p) {
}
showTrunks(p.prev);
console.log(p.str);
process.stdout.write(p.str);
}
module.exports = {
module.exports = {
printTree,
printLinkedList,
}

View file

@ -8,9 +8,9 @@
* Definition for a binary tree node.
*/
function TreeNode(val, left, right) {
this.val = (val === undefined ? 0 : val) // 结点值
this.left = (left === undefined ? null : left) // 左子结点指针
this.right = (right === undefined ? null : right) // 右子结点指针
this.val = (val === undefined ? 0 : val); // 结点值
this.left = (left === undefined ? null : left); // 左子结点指针
this.right = (right === undefined ? null : right); // 右子结点指针
}
/**

View file

@ -65,9 +65,9 @@ comments: true
```js title=""
/* 链表结点类 */
function TreeNode(val, left, right) {
this.val = (val === undefined ? 0 : val) // 结点值
this.left = (left === undefined ? null : left) // 左子结点指针
this.right = (right === undefined ? null : right) // 右子结点指针
this.val = (val === undefined ? 0 : val); // 结点值
this.left = (left === undefined ? null : left); // 左子结点指针
this.right = (right === undefined ? null : right); // 右子结点指针
}
```
@ -201,10 +201,10 @@ comments: true
/* 初始化二叉树 */
// 初始化结点
let n1 = new TreeNode(1),
n2 = new TreeNode(2),
n3 = new TreeNode(3),
n4 = new TreeNode(4),
n5 = new TreeNode(5);
n2 = new TreeNode(2),
n3 = new TreeNode(3),
n4 = new TreeNode(4),
n5 = new TreeNode(5);
// 构建引用指向(即指针)
n1.left = n2;
n1.right = n3;