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

分析：
这题递归的解法要点是要记住到达父节点的路径

之前有考虑直接在返回的List上做递归，但是List为对象，分为左右子树的时候，容易出现问题。有考虑到直接传String，然后拼接，是否有内存、效率的问题。因为递归的话，就是要保存这些信息，用对象还要copy，所以开销是一样的。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if(root==null) return res;
        addPath(root, res, "");
        return res;
    }

    void addPath(TreeNode node, List<String> res, String pre){
        if(node.left==null && node.right==null) res.add(pre+node.val);

        if(node.left!=null) addPath(node.left, res, pre+node.val+"->");
        if(node.right!=null) addPath(node.right, res, pre+node.val+"->");
    }
}

最后发现跟top answer 一样

Accepted Java simple solution in 8 lines
public List<String> binaryTreePaths(TreeNode root) {
    List<String> answer = new ArrayList<String>();
    if (root != null) searchBT(root, "", answer);
    return answer;
}
private void searchBT(TreeNode root, String path, List<String> answer) {
    if (root.left == null && root.right == null) answer.add(path + root.val);
    if (root.left != null) searchBT(root.left, path + root.val + "->", answer);
    if (root.right != null) searchBT(root.right, path + root.val + "->", answer);
}