题解 | #求二叉树的层序遍历#
求二叉树的层序遍历
https://www.nowcoder.com/practice/04a5560e43e24e9db4595865dc9c63a3
/* * function TreeNode(x) { * this.val = x; * this.left = null; * this.right = null; * } */ /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @return int整型二维数组 */ function levelOrder(root) { const res = []; if (!root) return res; const queue = [root]; while (queue.length) { let size = queue.length; let temp = []; // 解题思路:每一行节点放在queue中,取出消费,并把节点的下一级节点放入queue中 while (size-- > 0) { const node = queue.shift(); temp.push(node.val); node.left && queue.push(node.left); node.right && queue.push(node.right); } res.push(temp); } return res; } module.exports = { levelOrder: levelOrder, };