/**
* 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>> res;
if (root == NULL)
return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
// 这层树的节点个数
int nums = q.size();
vector<int> v;
for (int i = 0; i < nums; i++){
TreeNode* tmp = q.front();
q.pop();
if (tmp->left != NULL)
q.push(tmp->left);
if (tmp->right != NULL)
q.push(tmp->right);
v.push_back(tmp->val);
}
res.push_back(v);
}
return res;
}
};
static int x=[](){
std::ios::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}();
LetCode 102. 二叉树的层次遍历
最新推荐文章于 2018-08-22 10:31:55 发布