Leetcode/leetcode102.cpp at main · ksaini-web/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
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {


        vector<vector<int>>Reslt;
         if(!root) return Reslt;

        queue<TreeNode*>q;

        q.push(root);

        while(!q.empty()){

            vector<int>level;

            int size = q.size();

            for(int i = 0;i<size;i++){

                TreeNode* node = q.front();

                q.pop();

                level.push_back(node->val);

                if(node->left) q.push(node->left);

                if(node->right) q.push(node->right);


            }
            Reslt.push_back(level);
        }


        return Reslt;
    }
};