LeetCode/107.cpp at master · nitin-maharana/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
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

/**
 * 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 {
    queue<TreeNode*> q1, q2;
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        vector<vector<int>> result;
        int level = 0;

        if(!root)
            return result;

        q1.push(root);
        vector<int> tempRes;

        TreeNode *tempPtr;

        while(!q1.empty() || !q2.empty())
        {
            tempRes.clear();

            if(level % 2)
            {
                while(!q2.empty())
                {
                    tempPtr = q2.front();
                    tempRes.push_back(tempPtr->val);
                    if(tempPtr->left)
                        q1.push(tempPtr->left);

                    if(tempPtr->right)
                        q1.push(tempPtr->right);

                    q2.pop();
                }
            }
            else
            {
                while(!q1.empty())
                {
                    tempPtr = q1.front();
                    tempRes.push_back(tempPtr->val);
                    if(tempPtr->left)
                        q2.push(tempPtr->left);

                    if(tempPtr->right)
                        q2.push(tempPtr->right);

                    q1.pop();
                }
            }

            level++;
            result.push_back(tempRes);
        }

        reverse(result.begin(), result.end());

        return result;
    }
};