algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues 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
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;
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());