【leetcode】257. 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"]

题目解读：给一棵二叉树，列出所有从根节点到叶子节点的路径。

思路：用深度遍历，递归方法。注意存储沿途节点的值。一开始有思路但是不知道怎么去实现。看了别人的代码，才觉得很巧妙。

c++代码（4ms，23.18%）

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

    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string>result;
        if(root==NULL)
            return result;
            
        addPath(result, root, to_string(root->val));
        return result;
        
    }
};