面试题60：把二叉树打印成多行

题目描述
从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。

---

解：
队列实现

---

/*
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>> result;
            if(!pRoot)
                return result;
            int toBePrinted = 1;
            int nextLevel = 0;
            queue<TreeNode*> q;
            q.push(pRoot);
            vector<int> v;
            while(!q.empty()){
                TreeNode* pCur = q.front();
                q.pop();
                v.push_back(pCur->val);
                --toBePrinted;
                if(pCur->left){
                    q.push(pCur->left);
                    ++nextLevel;
                }

                if(pCur->right){
                    q.push(pCur->right);
                    ++nextLevel;

                }
                if(!toBePrinted){
                    result.push_back(v);
                    v.clear();
                    toBePrinted = nextLevel;
                    nextLevel = 0;
                }
            }
            return result;
        }

};