LeetCode OJ:Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2024-10-18 10:39:20 发布

_王川

最新推荐文章于 2024-10-18 10:39:20 发布

阅读量785

点赞数

分类专栏： LeetCode 文章标签： leetcode 层序遍历

本文链接：https://blog.csdn.net/starcuan/article/details/18667765

版权

LeetCode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

Binary Tree Zigzag Level Order Traversal

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,#,#,15,7},

return its zigzag level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

算法思想：

按照层序遍历思想，根据访问到奇偶数层处理先后问题

/**
 * Definition for binary tree
 * 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>> result;  
        if(!root)return result;  
        list<list<int>> r;  
        list<int> t;  
        int fang=0;
        int curLev=1;  
        int nextLev=0;  
        queue<TreeNode *> que;  
        que.push(root);  
        while(!que.empty()){  
            TreeNode *cur=que.front();  
            que.pop();  
            if(!fang)
                t.push_back(cur->val);
            else t.push_front(cur->val);
            if(cur->left){  
                nextLev++;  
                que.push(cur->left);  
            }  
            if(cur->right){  
                nextLev++;  
                que.push(cur->right);  
            }  
            if(--curLev==0){  
                r.push_back(t);  
                t.clear();  
                curLev=nextLev;  
                nextLev=0;  
                fang^=1;
            }  
        }  
        for(auto &v:r){  
            vector<int> k;  
            for(int i:v){  
                k.push_back(i);  
            }  
            result.push_back(k);  
        }  
        return result;  
    }
};

递归版

/**
 * Definition for binary tree
 * 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>> result;
        traverse(root,1,result,true);
        return result;
    }
    void traverse(TreeNode *root,size_t level,vector<vector<int>> &result,bool left_to_right){
        if(!root)return;
        
        if(level>result.size())
            result.push_back(vector<int>());
        
        if(left_to_right)
            result[level-1].push_back(root->val);
        else
            result[level-1].insert(result[level-1].begin(),root->val);
            
        traverse(root->left,level+1,result,!left_to_right);
        traverse(root->right,level+1,result,!left_to_right);
    }
};