binary-tree-zigzag-level-order-traversal

stloztoeplitz

于 2016-12-27 12:33:08 发布

阅读量267

点赞数

分类专栏：树

本文链接：https://blog.csdn.net/stloztoeplitz/article/details/53894520

版权

树专栏收录该内容

10 篇文章 0 订阅

订阅专栏

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
vector<TreeNode*> tmp;
vector<vector<int>> ans;
void f(TreeNode* root) {
    tmp.push_back(root);
    int i=1;
    while(!tmp.empty()) {
      vector<TreeNode*> t;
      vector<int> tt;
      int flag = 0; 
        if(i==-1) {
        for(int j=tmp.size()-1;j>=0;j--) {
          if(tmp[j]!=NULL) {
              flag = 1;
           tt.push_back(tmp[j]->val);
           }
        }


        }
         for(int j=0;j<=tmp.size()-1;j++) {
           if(tmp[j]!=NULL) {
           t.push_back(tmp[j]->left);
           t.push_back(tmp[j]->right);}
       }
       if(i==1) {
        for(int j=0;j<=tmp.size()-1;j++) {
           if(tmp[j]!=NULL) {
               flag = 1;
           tt.push_back(tmp[j]->val);
          }
        }
       }
        i=-1*i;
        if(flag == 1)
        ans.push_back(tt);
        tmp = t;
    }
}


class Solution {
public:
    vector<vector<int> > zigzagLevelOrder(TreeNode *root) {
        ans.clear(); tmp.clear();
        f(root);
        return ans;
    }
};