力扣-102题（Java and C++）-队列+二叉树层序遍历+附大宝的C++版

题目链接：https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
题目如下：

Java：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {

        List<List<Integer>> result=new ArrayList<List<Integer>>();
        if(root==null) return result;
        
        Queue<TreeNode> queue=new LinkedList<TreeNode>();//用于处理的队列
        queue.offer(root);

        while(!queue.isEmpty()){ 

            int size=queue.size();//队列里还有的元素个数
            List<Integer> level_temp=new ArrayList<Integer>();//二叉树当前层的临时List

            while(size--!=0){
                TreeNode node=queue.poll();//删除并返回第一个元素
                level_temp.add(node.val);

                //判断其是否有左右孩子节点，有则放入队列
                if(node.left!=null) queue.offer(node.left);
                if(node.right!=null) queue.offer(node.right);
            }
            result.add(level_temp);//将当前层的List放入待返回的result中
        }
        return result;
    }
}

C++：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if (!root) return res;
        queue<TreeNode*> que;
        que.push(root);
        while (!que.empty()) {
            int sz =que.size();
            vector<int> tmp;
            while(sz--) {
                TreeNode* t = que.front();
                que.pop();
                tmp.push_back(t->val);
                if (t->left) que.push(t->left);
                if (t->right) que.push(t->right);
            }
            res.push_back(tmp);
        }
        return res;
    }
};