剑指 Offer 32 - III. 从上到下打印二叉树 III
/**
* 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> > result;
vector<int> V;
queue<TreeNode*> Q;
TreeNode* p;
int tag = 1;
if(root) Q.push(root);
while(!Q.empty()) {
int len = Q.size();
V.clear();
for(int ii = 0; ii < len; ii++) {
p = Q.front();
Q.pop();
V.push_back(p->val);
if(p->left) Q.push(p->left);
if(p->right) Q.push(p->right);
}
if(tag == -1) reverse(V.begin(), V.end());
result.push_back(V);
tag *= -1;
}
return result;
}
};