Leetcode/BinaryTreeZigzagLevelOrderTraversal.cpp at master · Jessicahust/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include<iostream>
#include<new>
#include<vector>
#include<stack>
using namespace std;

//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)
    {
        stack<int> st;
        vector<vector<int> > vec;//用来存放每一层的关键字
        vector<vector<TreeNode*> > rvec; //用来存放每一层的结点
        size_t i=0;
        if(root==NULL)
            return vector<vector<int> >();
        vec.push_back({root->val});
        rvec.push_back({root});
        vector<int> v1; //用来存放一层的关键字
        vector<TreeNode*> v2; //用来存放一层的结点
        int flag=0;//控制是正序还是逆序打印该层的元素
        while(rvec.size())
        {
            v1.clear();
            v2.clear();
            if(flag==0)
            {
                //每次只对最后一层进行操作
                for(i=0; i<rvec[rvec.size()-1].size(); i++)
                {
                    TreeNode *tmp=rvec[rvec.size()-1][i];
                    if(tmp->left)
                    {
                        st.push(tmp->left->val);
                        v2.push_back(tmp->left);
                    }
                    if(tmp->right)
                    {
                        st.push(tmp->right->val);
                        v2.push_back(tmp->right);
                    }
                }
                while(!st.empty())
                {
                    v1.push_back(st.top());
                    st.pop();
                }
                if(!v1.empty()&&!v2.empty())
                {
                    vec.push_back(v1);
                    rvec.push_back(v2);
                }
                else
                    break;
                flag=1;
            }
            else
            {
                for(i=0; i<rvec[rvec.size()-1].size(); i++)
                {
                    TreeNode *tmp=rvec[rvec.size()-1][i];
                    if(tmp->left)
                    {
                        v1.push_back(tmp->left->val);
                        v2.push_back(tmp->left);
                    }
                    if(tmp->right)
                    {
                        v1.push_back(tmp->right->val);
                        v2.push_back(tmp->right);
                    }
                }
                if(!v1.empty()&&!v2.empty())
                {
                    vec.push_back(v1);
                    rvec.push_back(v2);
                }
                else
                    break;
                flag=0;
            }
        }
        return vec;
    }
    void createTree(TreeNode *&root)
    {
        int i;
        cin>>i;
        if(i!=0)
        {
            root=new TreeNode(i);
            if(root==NULL)
                return;
            createTree(root->left);
            createTree(root->right);
        }
    }
};

int main()
{
    Solution s;
    TreeNode *root;
    s.createTree(root);
    vector<vector<int> > vec=s.zigzagLevelOrder(root);
    for(auto a:vec)
    {
        for(auto v:a)
            cout<<v<<" ";
        cout<<endl;
    }
}