LeetCode103. Binary Tree Zigzag Level Order Traversal（C++）

最新推荐文章于 2021-05-21 08:00:07 发布

Brielleqqqqqqjie

最新推荐文章于 2021-05-21 08:00:07 发布

阅读量185

点赞数 1

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_41562704/article/details/87167629

版权

Leetcode 专栏收录该内容

110 篇文章 2 订阅

订阅专栏

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],

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

解题思路：在102的基础上，DFS遍历的过程中分两种情况，当level数为偶数，则先遍历左子树，为奇数先遍历右子树。

/**
 * 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>>result;
    int maxlevel=0;
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        if(root==NULL)
            result.resize(0);
        else{
            result.resize(1005);
            dfs(root,0);
            result.resize(maxlevel+1);
        }  
        return result;
    }
    void dfs(TreeNode *root, int level){
        if(root==NULL)
            return;
        if(level%2==0)
            result[level].push_back(root->val);
        else
            result[level].insert(result[level].begin(),root->val);
        maxlevel=max(maxlevel,level);
        dfs(root->left,level+1);
        dfs(root->right,level+1);
    }
};