[leetcode]103. Binary Tree Zigzag Level Order Traversal-CSDN博客

本文介绍了一个LeetCode上的经典算法题目——二叉树锯齿形层次遍历。文章详细解析了如何通过层级遍历的方式，先从左到右再从右到左交替进行节点值的获取，并提供了一段C++实现代码作为参考。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

[leetcode]103. Binary Tree Zigzag Level Order Traversal

Analysis

fighting—— [每天刷题并不难0.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).
在这里插入图片描述

Explanation:

Traversing the given binary tree by level, first level:from left to right, second level:from right to left, third level:from left to right…

Implement

/**
 * 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)
            return res;
        
        queue<TreeNode*> nq;
        nq.push(root);
        bool left2right = true;
        while(!nq.empty()){
            int size = nq.size();
            vector<int> tmp;
            for(int i=0; i<size; i++){
                TreeNode* node = nq.front();
                nq.pop();
                tmp.push_back(node->val);
                if(node->left)
                    nq.push(node->left);
                if(node->right)
                    nq.push(node->right);
            }
            if(!left2right)
                reverse(tmp.begin(), tmp.end());
            res.push_back(tmp);
            left2right = !left2right;
        }
        return res;
    }
};