题目
难度中等328
给定一个二叉树,返回其节点值的锯齿形层序遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回锯齿形层序遍历如下:
[ [3], [20,9], [15,7] ]
解题思路
采用二叉树的层次遍历,但是奇数层先左节点再右节点,偶数层先右节点再左节点,节点都保存到vector中,每次从尾部开始取数据,这样就形成了交替的Z形。
代码
/**
* 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>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> res;
if (root == NULL)
{
return res;
}
vector<TreeNode*> curNodes;
vector<TreeNode*> childNodes;
int reverse= 0;
curNodes.push_back(root);
while(curNodes.size() > 0)
{
vector<int> tmpVal;
for (int i = curNodes.size()-1; i >= 0; i--)
{
tmpVal.push_back(curNodes[i]->val);
if (reverse == 0)
{
if (curNodes[i]->left != NULL)
{
childNodes.push_back(curNodes[i]->left);
}
if (curNodes[i]->right != NULL)
{
childNodes.push_back(curNodes[i]->right);
}
}
else
{
if (curNodes[i]->right != NULL)
{
childNodes.push_back(curNodes[i]->right);
}
if (curNodes[i]->left != NULL)
{
childNodes.push_back(curNodes[i]->left);
}
}
}
curNodes = childNodes;
childNodes.clear();
res.push_back(tmpVal);
reverse = 1-reverse;
}
return res;
}
};