题目描述
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
思路1:之字形打印,层次遍历,用两个栈。s1为奇数行 s1输入元素应先右后左;s2为偶数行 s2输入元素应先左后右
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector<vector<int>> res;
vector<int> arr;
if (pRoot == nullptr)
return res;
stack<TreeNode*> s1;
stack<TreeNode*> s2;
s1.push(pRoot);
while (!s1.empty() || !s2.empty())
{
TreeNode* tmp = nullptr;
arr.clear();
while (!s1.empty()) //s1存放奇数行
{
tmp = s1.top();
arr.push_back(tmp->val);
s1.pop();
if (tmp->left)
s2.push(tmp->left); //s2存放下一层元素,为偶数行,输入元素应先左后右
if (tmp->right)
s2.push(tmp->right);
}
if (arr.size() != 0)
res.push_back(arr);
arr.clear();
while (!s2.empty()) //s2存放偶数行
{
tmp = s2.top();
arr.push_back(tmp->val);
s2.pop();
if (tmp->right)
s1.push(tmp->right); //下一层输入元素应先右后左
if (tmp->left)
s1.push(tmp->left);
}
if (arr.size() != 0)
res.push_back(arr);
}
return res;
}
};
思路2:使用队列按层次遍历,先统一存入数组,然后对于偶数行,进行reverse数组反转。(但是海量数据时,效率低)
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector<vector<int>> res;
vector<int> arr;
if (pRoot == nullptr)
return res;
queue<TreeNode*> q;
q.push(pRoot);
int count = 0; //用于记录是奇数行还是偶数行
while (!q.empty())
{
int size = q.size();
arr.clear();
for (int i = 0; i < size; i++) {
TreeNode* tmp = q.front();
arr.push_back(tmp->val);
q.pop();
if (tmp->left)
q.push(tmp->left);
if (tmp->right)
q.push(tmp->right);
}
count++;
if (count % 2 == 0) //如果是偶数行,则进行reverse翻转
reverse(arr.begin(), arr.end());
res.push_back(arr);
}
return res;
}
};
思路3:双向队列,奇数层从左到右打印,下一层的元素就从后入队;偶数层从右向左打印,下一层元素从前入队
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector<vector<int>> res;
vector<int> arr;
if (pRoot == nullptr)
return res;
deque<TreeNode*> dq;
dq.push_back(pRoot);
bool flag = true;
while (!dq.empty())
{
int size = dq.size();
arr.clear();
TreeNode* tmp = nullptr;
while (size-- > 0)
{
if (flag) { //奇数行,从左向右打印,前取后放
tmp = dq.front();
dq.pop_front();
if (tmp->left)
dq.push_back(tmp->left); //下一层顺序存放队尾
if (tmp->right)
dq.push_back(tmp->right);
}
else { //偶数行,从右往左打印,后取前放
tmp = dq.back();
dq.pop_back();
if (tmp->right)
dq.push_front(tmp->right); //下一层逆序存放队首
if (tmp->left)
dq.push_front(tmp->left);
}
arr.push_back(tmp->val);
}
flag = !flag;
res.push_back(arr);
}
return res;
}
};