Data-Structures-and-Algos/binary_tree_paths.cpp at master · Adityaweb3/Data-Structures-and-Algos · 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
// Problem Link : https://leetcode.com/problems/binary-tree-paths/description/

/**
 * 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(vector<string>&ans , TreeNode *root , string t){
    if(!root->left && !root->right){
        ans.push_back(t) ;
        return ;
    }

    if(root->left){
        solve(ans , root->left , t+"->"+to_string(root->left->val)) ;
    }

    if(root->right){
        solve(ans , root->right , t+"->"+to_string(root->right->val)) ;
    }
  }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string>ans ;
        if(root==NULL){
            return ans ;
        }

        solve(ans , root, to_string(root->val)) ;
        return ans;
    }
};