algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

add JavaScript codes for PrintUtil

Browse Source
This commit is contained in:
IsChristina
2022-12-04 23:14:09 +08:00
parent db416cf4bb
commit 003dcc56f4
5 changed files with 105 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -5,6 +5,7 @@
*/
const Tree = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
/* 二叉搜索树 */
var root;
@ -122,7 +123,7 @@ function min(root) {
var nums = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ];
BinarySearchTree(nums)
console.log("\n初始化的二叉树为\n");
console.log(getRoot());
printTree(getRoot());
/* 查找结点 */
let node = search(5);
@ -131,15 +132,15 @@ console.log("\n查找到的结点对象为 " + node + "，结点值 = " + node.v
/* 插入结点 */
node = insert(16);
console.log("\n插入结点 16 后，二叉树为\n");
console.log(getRoot());
printTree(getRoot());
/* 删除结点 */
remove(1);
console.log("\n删除结点 1 后，二叉树为\n");
console.log(getRoot());
printTree(getRoot());
remove(2);
console.log("\n删除结点 2 后，二叉树为\n");
console.log(getRoot());
printTree(getRoot());
remove(4);
console.log("\n删除结点 4 后，二叉树为\n");
console.log(getRoot());
printTree(getRoot());

9
codes/javascript/chapter_tree/binary_tree.js
View File

@ -5,7 +5,8 @@
*/
const Tree = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
/* 初始化二叉树 */
// 初始化结点
let n1 = new Tree.TreeNode(1),
@ -19,7 +20,7 @@ n1.right = n3;
n2.left = n4;
n2.right = n5;
console.log("\n初始化二叉树\n")
console.log(n1)
printTree(n1)
/* 插入与删除结点 */
let P = new Tree.TreeNode(0);
@ -27,8 +28,8 @@ let P = new Tree.TreeNode(0);
n1.left = P;
P.left = n2;
console.log("\n插入结点 P 后\n");
console.log(n1);
printTree(n1);
// 删除结点 P
n1.left = n2;
console.log("\n删除结点 P 后\n");
console.log(n1);
printTree(n1);

5
codes/javascript/chapter_tree/binary_tree_bfs.js
View File

@ -4,7 +4,8 @@
* Author: IsChristina (christinaxia77@foxmail.com)
*/
let { arrToTree } = require("../include/TreeNode");
const { arrToTree } = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
/* 层序遍历 */
function hierOrder(root) {
@ -29,7 +30,7 @@ function hierOrder(root) {
// 这里借助了一个从数组直接生成二叉树的函数
var root = arrToTree([1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null ]);
console.log("\n初始化二叉树\n");
console.log(root);
printTree(root);
/* 层序遍历 */
let list = hierOrder(root);

5
codes/javascript/chapter_tree/binary_tree_dfs.js
View File

@ -4,7 +4,8 @@
* Author: IsChristina (christinaxia77@foxmail.com)
*/
let { arrToTree } = require("../include/TreeNode");
const { arrToTree } = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
// 初始化列表，用于存储遍历序列
var list = []
@ -41,7 +42,7 @@ function postOrder(root) {
// 这里借助了一个从数组直接生成二叉树的函数
var root = arrToTree([1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null]);
console.log("\n初始化二叉树\n");
console.log(root);
printTree(root);
/* 前序遍历 */
list.length = 0;