102. 二叉树的层序遍历
给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)。
示例:
二叉树:[3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其层次遍历结果:
[ [3], [9,20], [15,7] ]
通过次数
104,076
提交次数
169,249
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
if root is None:
return []
ans = []
q = []
q.append(root)
while len(q):
qsize = len(q)
res_tmp = []
while qsize:
cur_node = q.pop(0)
res_tmp.append(cur_node.val)
if cur_node.left is not None:
q.append(cur_node.left)
if cur_node.right is not None:
q.append(cur_node.right)
qsize -= 1
ans.append(res_tmp)
return ans
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int> >ans;
if(!root)
return ans;
vector<int>cur_lev; //保存一层的结果
queue<TreeNode *> q;
q.push(root);
while(!q.empty()){
int cnt = q.size();//当前层的结点数
while(cnt--){
TreeNode *node = q.front();
cur_lev.push_back(node->val);
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);
q.pop();
}
ans.push_back(cur_lev);
cur_lev.clear();
}
return ans;
}
};
所得:
当前队列的size即为二叉树当前层的结点数