剑指 Offer 32 - II. 从上到下打印二叉树 II C++ 2021-08-15

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

1、典型层序遍历，就是队列实现

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

        TreeNode* node = root;
        queue<TreeNode*> que;
        que.push(node);

        while (!que.empty())
        {
            int count = que.size();
            vector<int> path;
            while (count > 0)
            {
                node = que.front();
                que.pop();
                path.push_back(node->val);
                count--;
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);
            }
            res.push_back(path);
        }
        return res;
             
    }
};