Merge pull request #104 from justin-tse/dev

Fix the PrintUtil.js showTrunks and Update JavaScript and docs' style (Chapter of Tree)

codes/javascript/chapter_tree/binary_search_tree.js

@@ -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 ];
+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");
 printTree(getRoot());
 

codes/javascript/chapter_tree/binary_tree.js

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

codes/javascript/chapter_tree/binary_tree_bfs.js

@@ -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);
 

codes/javascript/chapter_tree/binary_tree_dfs.js

@@ -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) {

codes/javascript/include/PrintUtil.js

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

codes/javascript/include/TreeNode.js

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

docs/chapter_tree/binary_tree.md

@@ -65,9 +65,9 @@ comments: true
     ```js title=""
     /* 链表结点类 */
     function TreeNode(val, left, right) {
-        this.val = (val === undefined ? 0 : val) // 结点值
+        this.val = (val === undefined ? 0 : val); // 结点值
-        this.left = (left === undefined ? null : left) // 左子结点指针
+        this.left = (left === undefined ? null : left); // 左子结点指针
-        this.right = (right === undefined ? null : right) // 右子结点指针
+        this.right = (right === undefined ? null : right); // 右子结点指针
     }
     ```