方法一:广度优先搜索
/**
* 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) return res; //空树
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
vector<int> tmp;
int n=q.size();
for(int i=0;i<n;i++){ //循环条件不能用q.size(),因为会变化
TreeNode* top= q.front();
q.pop();
tmp.push_back(top->val);
if(top->left)
q.push(top->left);
if(top->right)
q.push(top->right);
}
res.push_back(tmp);
}
return res;
}
};