题目
给定一个二叉树,返回其节点值的锯齿形层序遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [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() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> result;
traverse(result,1,true,root);
return result;
}
void traverse(vector<vector<int>>& result, int level, bool left_to_right, TreeNode* root){
if(root == NULL) return;
if(level > result.size()) result.push_back(vector<int>());
if(left_to_right) result[level-1].push_back(root->val);
else result[level-1].insert(result[level-1].begin(), root->val);
traverse(result, level+1, !left_to_right, root->left);
traverse(result, level+1, !left_to_right, root->right);
}
};
- 迭代版
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> result;
queue<TreeNode*> que;
bool left_to_right = true;//判断是从左到右还是从右到左
if(root != NULL) que.push(root);
while(!que.empty()){//依次处理每一层
int size = que.size();
vector<int> level;
//得到该层的遍历序列
for(int i=0; i<size; i++){
TreeNode* node = que.front();
que.pop();
level.push_back(node->val);
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
if(!left_to_right) reverse(level.begin(), level.end());
result.push_back(level);
left_to_right = !left_to_right;
}
return result;
}
};
- 时间复杂度O(n)
- 空间复杂度O(n)
- 思路
- 在层序遍历的基础上增加一个bool型遍历,每过一层就将该变量取反一次。该变量初始化为true,如果为false就将该层的变量翻转后加入到层序遍历结果中。