【LeetCode】103. Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2023-12-04 10:28:35 发布

wisdom610

最新推荐文章于 2023-12-04 10:28:35 发布

阅读量157

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/xuanwozhe/article/details/78578111

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its zigzag level order traversal as:
[
[3],
[20,9],
[15,7]
]

与102题类似，初看题目感觉要双向访问每层的结点，因此抛弃了队列，直接使用了vector
/**
 * 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;

        unsigned int level = 0; // 记录层数，用于判断访问左右子树的顺序
        vector<int> sub;

        vector<TreeNode *> q;
        q.push_back(root);

        while (q.size() != 0) {
            vector<TreeNode *> tq;
            for (int i = 0; i < q.size(); ++i) {   // 遍历当前层的结点
                sub.push_back(q[i]->val);
            }
            for (int i = q.size()-1; i>=0; --i) {
                // 根据level判断访问左右子树的顺序
                if ((level & 0x01) == 0) {
                    if (q[i]->right != NULL) tq.push_back(q[i]->right);
                    if (q[i]->left != NULL)  tq.push_back(q[i]->left);
                } else {
                    if (q[i]->left != NULL)  tq.push_back(q[i]->left);
                    if (q[i]->right != NULL) tq.push_back(q[i]->right);
                }
            }

            res.push_back(sub);
            sub.clear();
            q = tq;
            ++level;
        }

        return res;
    }
};