(leetcode)二叉树层次遍历

/**
 * 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) {
        TreeNode *p;
        vector<vector<int>> a;
        //初始化队列
        queue<TreeNode*> q;
        if(root == NULL) return a;
        if(root != NULL){
            //根节点入队
            q.push(root);
            //出队
            while(!q.empty()){
                //获取每一层的节点数
                int size = q.size();
                vector<int> temp;
                //将每一层的节点出栈
                for(int i = 0;i < size;++i){
                    p = q.front();
                    q.pop();
                    temp.push_back(p->val);
                    if(p->left != NULL) q.push(p->left);
                    if(p->right != NULL) q.push(p->right);
                }
                a.push_back(temp);
            }
        }
        return a;
    }
};