题目传送门
题解
AC-Code
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
queue<TreeNode*> que;
vector<vector<int> > ans;
if(pRoot) que.push(pRoot);
bool flag = false;
while(!que.empty()) {
int sz = que.size();
vector<int> res;
while(sz--) {
TreeNode *pnode = que.front();
que.pop();
res.push_back(pnode->val);
if(pnode->left) que.push(pnode->left);
if(pnode->right) que.push(pnode->right);
}
if(flag )
reverse(res.begin(), res.end());
ans.push_back(res);
flag = !flag;
}
return ans;
}
};