Leetcode之Binary Tree Paths

题目：

Given a binary tree, return all root-to-leaf paths.

Note: A leaf is a node with no children.

Example:

Input:

   1
 /   \
2     3
 \
  5

Output: ["1->2->5", "1->3"]

Explanation: All root-to-leaf paths are: 1->2->5, 1->3

代码：

/**
 * 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:
    void helper(TreeNode* root, vector<string>& res, string s) {
   
    s += to_string(root->val);

    if (!root->left && !root->right) {
        res.push_back(s);
        return;
    }
    if (root->left) {
        
        helper(root->left, res, s+"->");
    }
    if (root->right) {
        
        helper(root->right, res, s+"->");
    }

}
vector<string> binaryTreePaths(TreeNode* root) {
    if (!root)return {};
    vector<string> v;
    string s;
    helper(root, v, s);
    return v;
}

};