【leetcode每日一题】NO257.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"]

解析：这道题目是给定一颗二叉树，得到从根节点到所有叶子节点的路径。使用深度优先遍历的方法，从上到下遍历，如果是叶子节点，则把字符串压入到结果中。代码如下：

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