剑指 Offer 32 - III. 从上到下打印二叉树 III
题目链接:题目链接
请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右到左的顺序打印,第三行再按照从左到右的顺序打印,其他行以此类推。
例如:
给定二叉树: [3,9,20,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[20,9],
[15,7]
]
提示:
节点总数 <= 1000
方法1:先都从左往右打印,在偶数行反转
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
queue<TreeNode *> q;
q.push(root);
if(!root) return res;
while(!q.empty()){
int col = q.size();
vector<int> tmp;
while(col--){
TreeNode *p = q.front();
q.pop();
tmp.push_back(p->val);
if(p->left!=NULL) q.push(p->left);
if(p->right!= NULL) q.push(p->right);
}
res.push_back(tmp);
}
return res;
}
};
方法2:使用双向链表
设立一个标志,每遍历一层,将flag取反
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
deque<TreeNode *> q;
q.push_back(root);
bool flag = true;
if(!root) return res;
while(!q.empty()){
int col = q.size();
vector<int> tmp;
while(col--){
if(!flag){ //flag = false从右往左
TreeNode *p = q.back();
q.pop_back();
tmp.push_back(p->val);
if(p->right!= NULL) q.push_front(p->right);
if(p->left!=NULL) q.push_front(p->left);
}
else // flag = true 从左往右
{
TreeNode *p = q.front();
q.pop_front();
tmp.push_back(p->val);
if(p->left!=NULL) q.push_back(p->left);
if(p->right!= NULL) q.push_back(p->right);
}
}
flag = !flag;
res.push_back(tmp);
}
return res;
}
};