CrackYourInternship/Binary Tree Level Order Traversal.cpp at main · codehub001/CrackYourInternship · 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
/**
 * 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:
    void solve(TreeNode* root, vector<vector<int>>& ans, int i){
        if(root == NULL){
            return;
        }
        ans[i].push_back(root->val);
        solve(root->left, ans, i+1);
        solve(root->right, ans, i+1);
    }
    int findLevels(TreeNode* root){
        if(root == NULL){
            return 0;
        }
        int ans = max(findLevels(root->left), findLevels(root->right))+1;
        return ans;
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        int levels = findLevels(root);
        vector<vector<int>> ans(levels);
        int i = 0;
        solve(root, ans, i);
        return ans;

    }
};