題目描述：
給一棵二叉樹君丁，找出從根節(jié)點到葉子節(jié)點的所有路徑夭坪。
樣例：
給出下面這棵二叉樹：
1
/ \
2 3
\
5
所有根到葉子的路徑為：
[
"1->2->5",
"1->3"
]
代碼實現(xiàn)：
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root the root of the binary tree
* @return all root-to-leaf paths
*/
public List<String> binaryTreePaths(TreeNode root) {
List<String> paths = new ArrayList<>();
if (root == null) {
return paths;
}
//root is a leaf
if (root.left == null && root.right == null) {
paths.add(root.val + "");
}
List<String> leftPath = binaryTreePaths(root.left);
List<String> rightPath = binaryTreePaths(root.right);
for (String path : leftPath) {
paths.add(root.val + "->" + path);
}
for (String path : rightPath) {
paths.add(root.val + "->" + path);
}
return paths;
}
}
