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

Fomrat the JS and TS codes with prettier.

Browse Source
This commit is contained in:
krahets
2023-04-17 21:58:11 +08:00
parent 9a98ff8a5e
commit c4ea4e39f3
68 changed files with 634 additions and 510 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -4,8 +4,8 @@
* Author: IsChristina (christinaxia77@foxmail.com)
*/
const { arrToTree } = require("../modules/TreeNode");
const { printTree } = require("../modules/PrintUtil");
const { arrToTree } = require('../modules/TreeNode');
const { printTree } = require('../modules/PrintUtil');
/* 层序遍历 */
function levelOrder(root) {
@@ -14,13 +14,10 @@ function levelOrder(root) {
// 初始化一个列表，用于保存遍历序列
const list = [];
while (queue.length) {
let node = queue.shift(); // 队列出队
list.push(node.val); // 保存节点值
if (node.left)
queue.push(node.left); // 左子节点入队
if (node.right)
queue.push(node.right); // 右子节点入队
let node = queue.shift(); // 队列出队
list.push(node.val); // 保存节点值
if (node.left) queue.push(node.left); // 左子节点入队
if (node.right) queue.push(node.right); // 右子节点入队
}
return list;
}
@@ -29,9 +26,9 @@ function levelOrder(root) {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
const root = arrToTree([1, 2, 3, 4, 5, 6, 7]);
console.log("\n初始化二叉树\n");
console.log('\n初始化二叉树\n');
printTree(root);
/* 层序遍历 */
const list = levelOrder(root);
console.log("\n层序遍历的节点打印序列 = " + list);
console.log('\n层序遍历的节点打印序列 = ' + list);