题目
LeetCode - 103. Binary Tree Zigzag Level Order Traversal
题目链接
https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/
参考博客
https://blog.csdn.net/whutshiliu/article/details/96142289
解题思路
本题主体思想参考链接博客,对输出的二维向量做逆序处理。
解题代码
/**
* 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:
int maxheight = INT_MIN;
int findMaxHeight(TreeNode* root){
if(!root) return 0;
else return max(findMaxHeight(root->left), findMaxHeight(root->right)) + 1;
}
void dfs(vector<vector<int>>& v, TreeNode* root, int height){
if(!root) return ;
v[height].push_back(root->val);
dfs(v, root->left, height + 1);
dfs(v, root->right, height + 1);
}
vector<vector<int>> levelOrder(TreeNode* root) {
int mh = findMaxHeight(root);
vector<vector<int> > ans(mh);
dfs(ans, root, 0);
return ans;
}
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> tmp = levelOrder(root);
for(int i = 0; i < tmp.size(); i++){
if(i%2!=0) reverse(tmp[i].begin(), tmp[i].end());
}
return tmp;
}
};