小白笔记-----------------------------------------------------leetcode(257. Binary Tree Paths)

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

Note: A leaf is a node with no children.

Example:

Input:

1
/ \
2 3
\
5

Output: [“1->2->5”, “1->3”]

Explanation: All root-to-leaf paths are: 1->2->5, 1->3

这道题，看到的人都想做遍历，不就是遍历二叉树嘛，照着这个思路来，遇到叶子节点加入结果，遇到空节点返回结果，重点是在统计结果时，会发现统计顺序是从叶子到根，千万不要忘了根节点的值也要加上。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> result = new ArrayList();
        if(root == null){
            return result;
        }
        if(root.left == null && root.right == null){
            result.add(Integer.toString(root.val));
        }
        for(String s : binaryTreePaths(root.left)){
            result.add(Integer.toString(root.val) + "->" + s);
        }
        for(String s : binaryTreePaths(root.right)){
            result.add(Integer.toString(root.val) + "->" + s);
        }

        return result;



    }

}