leetcode257---Binary Tree Paths

问题描述：

Given 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"]

问题求解：

利用先序遍历，深度优先搜索方法求解。对此题而言，不适宜再采用中序遍历，因为如果path+"->"+to_string(root->val)的话，会出现”->1->2->5”的情况。

/**
 * 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> ret;
        //to_string()函数将int型转为string类型
        if(root) getPaths(ret, root, to_string(root->val));//先序，深度优先搜索
        return ret;
    }
    void getPaths(vector<string>& result, TreeNode* node, string path) {
        if(!node->left && !node->right){//到达叶子节点，便将当前路径加入到vector
            result.push_back(path);
            //return ;
        }
        if(node->left) getPaths(result, node->left, path+"->"+to_string(node->left->val));
        if(node->right) getPaths(result, node->right, path+"->"+to_string(node->right->val));
    }

};