Update JavaScript style (Chapter of Tree)

codes/javascript/chapter_tree/binary_search_tree.js

@@ -121,7 +121,7 @@ function min(root) {
 /* Driver Code */
 /* 初始化二叉搜索树 */
 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

@@ -19,8 +19,8 @@ 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);

codes/javascript/chapter_tree/binary_tree_dfs.js

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