Leetcode 257. Binary Tree Paths

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

For example, given the following binary tree:

   1
 /   \
2     3
 \
  5

All root-to-leaf paths are:

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

递归实现DFS，从根节点开始，先序遍历，经过一个节点的时候，将节点加入path的字符串中，检测左子节点和右子节点是否为空，如果为空，该节点则为叶子节点，直接将path加入保存路径的vector，如果不是叶子节点，则将当前的path作为遍历下一个节点的输入，直到遍历完整棵二叉树，得到结果。

/**
 * 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> result;
        help(result, root, "");
        return result;
    }
    void help(vector<string>& result, TreeNode* root, string path) {
        if (!root) return;
        if (!path.length()) {
            path += to_string(root->val);
        } else {
            path += "->";
            path += to_string(root->val);
        }
        if (root->left == root->right) {
            result.push_back(path);
        } else {
            help(result, root->left, path);
            help(result, root->right, path);
        }
    }
};