yige/js-practice
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

update: 二叉树的层序遍历

Browse Source
This commit is contained in:
yi-ge 2020-05-13 13:58:11 +08:00
parent f391e66174
commit 7ff3a150b7
2 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/tree/binary-tree-level-order-traversal.js
View File

@ -17,11 +17,11 @@ export const levelOrder = function (root) {
const leave = queue.length // 记录这一层有几个 const leave = queue.length // 记录这一层有几个
for (let i = 0; i < leave; i++) { // 一次性把固定个数的队列执行完 for (let i = 0; i < leave; i++) { // 一次性把固定个数的队列执行完
const node = queue.shift() const node = queue.shift()
if (node.left) queue.push(node.left) if (node && node.left) queue.push(node.left)
if (node.right) queue.push(node.right) if (node && node.right) queue.push(node.right)
tmp.push(node.val) if (node) tmp.push(node.val)
} }
res.push(tmp) if (tmp.length) res.push(tmp)
} }
return res return res

3
test/tree/binary-tree-level-order-traversal.test.js
View File

@ -8,4 +8,7 @@ test('二叉树的层序遍历', () => {
[9, 20], [9, 20],
[15, 7] [15, 7]
]) ])
const source1 = []
expect(levelOrder(Tree.arrToTree(source1))).toEqual([])
}) })