简单题 leetcode 练习 层序打印二叉树

题目：

有一棵二叉树，请设计一个算法，按照层次打印这棵二叉树。

给定二叉树的根结点root，请返回打印结果，结果按照每一层一个数组进行储存，所有数组的顺序按照层数从上往下，且每一层的数组内元素按照从左往右排列。保证结点数小于等于500。

AC代码：

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};*/
class TreePrinter {
public:
    vector<vector<int> > printTree(TreeNode* root) {
        // write code here
        vector<vector<int> > res;
        if(root == NULL) return res;
        queue<TreeNode*> q;
        q.push(root);
        TreeNode* last;
        TreeNode* nlast;
        last = root;
        vector<int> tmp;
        while(!q.empty()) {
            TreeNode *t = q.front();
            tmp.push_back(t->val);
            q.pop();
            
            if(t->left) {
                    nlast = t->left;                  
                    q.push(t->left);
            } 
            if(t->right) {
                    nlast = t->right;
                    q.push(t->right);
            }
            if(t == last) {
                    result.push_back(tmp);
                    tmp.clear();
                    last = nlast;
            }
        }
        return res;
    }
};