链接:https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof
题目:请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右到左的顺序打印,第三行再按照从左到右的顺序打印,其他行以此类推。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[20,9],
[15,7]
]
代码:
/**
* 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;
if(!root) return res;
q.push(root);
int count = 0;
while(!q.empty()) {
vector<int> tmp;
int size = q.size();
for(int i = 0; i < size; i++) {
TreeNode* node = q.front();
q.pop();
tmp.push_back(node -> val);
if(node -> left) q.push(node -> left);
if(node -> right) q.push(node -> right);
}
if(count % 2 != 0) {
reverse(tmp.begin(),tmp.end());
res.push_back(tmp);
}
else {
res.push_back(tmp);
}
count++;
}
return res;
}
};