LeetCode/257.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
/*
 * 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 {
    void binaryTreePaths(TreeNode *root, string visited, vector<string>& result)
    {
        if(root->left == nullptr && root->right == nullptr)
        {
            visited += to_string(root->val);
            result.push_back(visited);
            return;
        }

        if(root->left)
            binaryTreePaths(root->left, visited + to_string(root->val) + "->", result);

        if(root->right)
            binaryTreePaths(root->right, visited + to_string(root->val) + "->", result);

        return;
    }
public:
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> result;

        if(root == nullptr)
            return result;

        binaryTreePaths(root, "", result);

        return result;
    }
};