1.题目
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
2.我的题解
2.1 层次遍历
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector<vector<int> > res;
if(!pRoot)return res;
queue<TreeNode*> q;
q.push(pRoot);
while(!q.empty()){
vector<int> temp;
int cnt=q.size();
for(int i=0;i<cnt;i++){
temp.push_back(q.front()->val);
if(q.front()->left)q.push(q.front()->left);
if(q.front()->right)q.push(q.front()->right);
q.pop();
}
res.push_back(temp);
}
return res;
}
};