/*

 struct TreeNode {

     int val;

     struct TreeNode *left;

     struct TreeNode *right;

     TreeNode(int x) :

             val(x), left(NULL), right(NULL) {

     }

 };

 */

 class Solution

 {

 public:

     vector<vector<int> > Print(TreeNode* pRoot)

     {

         vector<vector<int> > res;

         if(pRoot == NULL)

             return res;

         queue<TreeNode*> Que;

         Que.push(pRoot);

         while(!Que.empty())

         {

             vector<int> vec;

             int size = Que.size();

             for(int i = ; i < size; i ++)

             {

                 TreeNode* temp = Que.front();

                 vec.push_back(temp->val);

                 if(temp->left)

                     Que.push(temp->left);

                 if(temp->right)

                     Que.push(temp->right);

                 Que.pop();

             }

             res.push_back(vec);

         }

         return res;

     }

 };