剑指 Offer 32 - III. 从上到下打印二叉树 III

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if(!root)   return res;		//空树
        queue<TreeNode*> q;
        q.push(root);
        bool flag=true;     //翻转标记位，true左到右，false右到左
        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);
            }
            if(!flag)
                reverse(tmp.begin(),tmp.end());
            flag=!flag;
            res.push_back(tmp);
        }
        return res;
    }
};