CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-12 07:05:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update JavaScript and TypeScript codes for all chapters, rename JavaScript and TypeScript import folder to modules (#402)

Browse Source 
* Update JavaScript and TypeScript codes

* Rename JavaScript and TypeScript import folder to modules
This commit is contained in:
Justin Tse
2023-03-03 01:34:53 +08:00
committed by GitHub
parent 7b41e6c2f0
commit e4a98bc9c5
61 changed files with 324 additions and 290 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,14 +1,14 @@
/**
* File: binary_tree.js
* File: binary_search_tree.js
* Created Time: 2022-12-04
* Author: IsChristina (christinaxia77@foxmail.com)
*/
const Tree = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
const { TreeNode } = require("../modules/TreeNode");
const { printTree } = require("../modules/PrintUtil");
/* 二叉搜索树 */
var root;
let root;
function BinarySearchTree(nums) {
nums.sort((a, b) => { return a - b }); // 排序数组
@@ -25,7 +25,7 @@ function buildTree(nums, i, j) {
if (i > j) return null;
// 将数组中间结点作为根结点
let mid = Math.floor((i + j) / 2);
let root = new Tree.TreeNode(nums[mid]);
let root = new TreeNode(nums[mid]);
// 递归建立左子树和右子树
root.left = buildTree(nums, i, mid - 1);
root.right = buildTree(nums, mid + 1, j);
@@ -64,7 +64,7 @@ function insert(num) {
else cur = cur.left;
}
// 插入结点 val
let node = new Tree.TreeNode(num);
let node = new TreeNode(num);
if (pre.val < num) pre.right = node;
else pre.left = node;
return node;
@@ -120,7 +120,7 @@ function getInOrderNext(root) {
/* Driver Code */
/* 初始化二叉搜索树 */
var nums = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15];
const nums = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15];
BinarySearchTree(nums);
console.log("\n初始化的二叉树为\n");
printTree(getRoot());