二叉树的所有路径（自己想的回溯解决，通常说用dfs一样）

给定一个二叉树，返回所有从根节点到叶子节点的路径。

说明: 叶子节点是指没有子节点的节点。

示例:

输入:

输出: [“1->2->5”, “1->3”]

解释: 所有根节点到叶子节点的路径为: 1->2->5, 1->3

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

观察，也可以提出一步来。但没有上面好理解就是了。

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