给一棵二叉树,找出从根节点到叶子节点的所有路径。
样例
给出下面这棵二叉树:
1
/ \
2 3
\
5
所有根到叶子的路径为:
[
"1->2->5",
"1->3"
]
突然发现重置按钮处有重置为大致框架 然后就无耻的试用了一次 helper的参数和英文注释都是它生成的 简单了太多 罪过罪过
/**
* 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) {
// Algorithm: DFS Traversal
// Use recursion to travere the tree.
List<String> result = new ArrayList<String>();
// check corner case
/* your code */
if(root == null){
return result;
}
// recursion
String path = "";
helper(root, path , result);
return result;
}
private void helper(TreeNode root, String path, List<String> result) {
/* your code */
//判断空
if(root == null){
return;
}
//到叶子节点加入result
if(root.left == null && root.right == null){
if(path.equals("")){
path += root.val;
}else{
path = path + "->" + root.val;
}
result.add(path);
return;
}
//节点加入path
if(path.equals("")){
path += root.val;
}else{
path = path + "->" + root.val;
}
//递归
helper(root.left ,path,result);
helper(root.right,path,result);
}
}