mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
0102二叉树的层序遍历javascript版本
This commit is contained in:
@ -79,6 +79,35 @@ public:
|
|||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
```
|
||||||
|
javascript代码:
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
var levelOrder = function(root) {
|
||||||
|
//二叉树的层序遍历
|
||||||
|
let res=[],queue=[];
|
||||||
|
queue.push(root);
|
||||||
|
if(root===null){
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
while(queue.length!==0){
|
||||||
|
// 记录当前层级节点数
|
||||||
|
let length=queue.length;
|
||||||
|
//存放每一层的节点
|
||||||
|
let curLevel=[];
|
||||||
|
for(let i=0;i<length;i++){
|
||||||
|
let node=queue.shift();
|
||||||
|
curLevel.push(node.val);
|
||||||
|
// 存放当前层下一层的节点
|
||||||
|
node.left&&queue.push(node.left);
|
||||||
|
node.right&&queue.push(node.right);
|
||||||
|
}
|
||||||
|
//把每一层的结果放到结果数组
|
||||||
|
res.push(curLevel);
|
||||||
|
}
|
||||||
|
return res;
|
||||||
|
};
|
||||||
|
|
||||||
```
|
```
|
||||||
|
|
||||||
**此时我们就掌握了二叉树的层序遍历了,那么如下五道leetcode上的题目,只需要修改模板的一两行代码(不能再多了),便可打倒!**
|
**此时我们就掌握了二叉树的层序遍历了,那么如下五道leetcode上的题目,只需要修改模板的一两行代码(不能再多了),便可打倒!**
|
||||||
|
Reference in New Issue
Block a user