Leetcode每日一题：剑指offer32.从上到下打印二叉树Ⅱ

BFS

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode *root)
    {
        vector<vector<int>> res;
        if (!root)
        {
            return res;
        }
        queue<TreeNode *> q;
        q.push(root);
        while (!q.empty())
        {
            int len = q.size();
            vector<int> temp;
            while (len--)
            {
                TreeNode *cur = q.front();
                q.pop();
                temp.push_back(cur->val);
                if (cur->left)
                    q.push(cur->left);
                if (cur->right)
                    q.push(cur->right);
            }
            res.push_back(temp);
        }
        return res;
    }
    
};