257. 二叉树的所有路径
给你一个二叉树的根节点 root ,按 任意顺序 ,返回所有从根节点到叶子节点的路径。
叶子节点 是指没有子节点的节点。
示例 1:
输入:root = [1,2,3,null,5]
输出:[“1->2->5”,“1->3”]
思路
使用前序遍历,递归+回溯
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<String> binaryTreePaths(TreeNode root) {
List<String> result = new ArrayList<>();
List<TreeNode> path = new ArrayList<>();
if(root == null){
return result;
}
reverseTree(root,path,result);
return result;
}
public void reverseTree(TreeNode root,List<TreeNode> path,List<String> result){
path.add(root);
if(root.left == null && root.right == null){
StringBuffer sb = new StringBuffer();
int i;
for(i = 0;i<path.size()-1;i++){
sb.append(path.get(i).val + "->");
}
sb.append(path.get(i).val);
result.add(sb.toString());
return;
}
if(root.left != null){
reverseTree(root.left,path,result);
path.remove(path.size()-1); //回溯
}
if(root.right != null){
reverseTree(root.right,path,result);
path.remove(path.size()-1); //回溯
}
}
}