给出一棵二叉树,返回其节点值的锯齿形层次遍历(先从左往右,下一层再从右往左,层与层之间交替进行)
样例
给出一棵二叉树 {3,9,20,#,#,15,7}
,
3 / \ 9 20 / \ 15 7
返回其锯齿形的层次遍历为:
[
[3],
[20,9],
[15,7]
]
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/*
* @param root: A Tree
* @return: A list of lists of integer include the zigzag level order traversal of its nodes' values.
*/
vector<vector<int>> zigzagLevelOrder(TreeNode * root) {
// write your code here
vector<vector<int>> res;
if (root == NULL) {
return res;
}
stack<TreeNode*> left;
stack<TreeNode*> right;
// root
left.push(root);
while (!left.empty() || !right.empty()) {
vector<int> level;
if (!left.empty()) {
while (!left.empty()) {
TreeNode* tn = left.top();
left.pop();
level.push_back(tn->val);
if (tn->left != NULL) {
right.push(tn->left);
}
if (tn->right != NULL) {
right.push(tn->right);
}
}
} else if (!right.empty()) {
while (!right.empty()) {
TreeNode* tn = right.top();
right.pop();
level.push_back(tn->val);
if (tn->right != NULL) {
left.push(tn->right);
}
if (tn->left != NULL) {
left.push(tn->left);
}
}
}
res.push_back(level);
}
return res;
}
};