LeetCode257-二叉树的所有路径(C++递归实现)

1.题目描述

给定一个二叉树，返回所有从根节点到叶子节点的路径。说明: 叶子节点是指没有子节点的节点。

示例:

输入:

   1
 /   \
2     3
 \
  5

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

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

2.C++代码实现(递归)

/**
 * 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 {
public:
    vector<string> binaryTreePaths(TreeNode* root) {

        vector<string> res;
        if(root == nullptr)
            return res;
        
        findPath(root, "", res);
        
        return res;        
    }
    
private:
    void findPath(TreeNode* root, string path, vector<string> &res)
    {        
        if(root->left == nullptr && root->right == nullptr)
        {
            res.push_back(path + to_string(root->val));
        }
        else
            path = path + to_string(root->val) + "->";
        
        if(root->left)
            findPath(root->left, path, res);
        
        if(root->right)
            findPath(root->right, path, res);
    }
};