lintcode_69_二叉树的层次遍历

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */


class Solution {
public:
    /*
     * @param root: A Tree
     * @return: Level order a list of lists of integer
     */
    vector<vector<int>> levelOrder(TreeNode * root) {
        // write your code here
        queue<TreeNode*> q;
        vector<vector<int>> ans;
        if(root==NULL)
            return ans;
        int len;
        q.push(root);
        while(!q.empty())
        {
            len=q.size();
            vector<int> res;
            while(len--)
            {
               TreeNode *p=q.front();
               q.pop();
               res.push_back(p->val);
               if(p->left)
                    q.push(p->left);
                if(p->right)
                    q.push(p->right);
                
            }
            ans.push_back(res);
        }
        return ans;
    }
};