牛客网-剑指office-把二叉树打印成多行

**题目：**从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。
**思路：**二叉树的层次遍历。利用两个队列将每行的节点分隔开来存储即可。

/*
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> > ans;
		if (pRoot == nullptr) return ans;
		queue<TreeNode*> q1;
		queue<TreeNode*> q2;
		q1.push(pRoot);
		vector<int> tmp;
		while (!q1.empty() || !q2.empty())
		{
			while (!q1.empty())
			{
				TreeNode* t = q1.front();
				q1.pop();
				if (t->left) q2.push(t->left);
				if (t->right) q2.push(t->right);
				tmp.push_back(t->val);
			}
			if (!tmp.empty()) ans.push_back(tmp);
			tmp.clear();
			while (!q2.empty())
			{
				TreeNode* t = q2.front();
				q2.pop();
				if (t->left) q1.push(t->left);
				if (t->right) q1.push(t->right);
				tmp.push_back(t->val);
			}
			if (!tmp.empty()) ans.push_back(tmp);
			tmp.clear();
		}
		return ans;
	}

};