面试题32 - II. 从上到下打印二叉树 II

题目：

 

 

解答：

/**
 * 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 (NULL == root)
        {
            return res;
        }

        queue<TreeNode*> q;
        q.push(root);
        int count = 1;
        int level = 0;
        
        vector<int> tmp;

        while (!q.empty())
        {
            tmp.clear();        
            level = 0;

            for (int i = 0; i < count; i++)
            {
                TreeNode *root = q.front();
                q.pop();
                tmp.push_back(root->val);

                if (root->left)
                {
                    q.push(root->left);
                    level++;
                }
                if (root->right)
                {
                    q.push(root->right);
                    level++;
                }
            }

            count = level;

            res.push_back(tmp);
        }

        return res;
    }
};