题目描述
题目链接:https://leetcode-cn.com/problems/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”]
解题思路
题目要我们输出从根节点到叶子节点所有的路径,和path sum 这类题目相比更加简单。只是需要处理字符串打印格式即可。
程序实现
public class Solution {
public List<String> binaryTreePaths(TreeNode root) {
List<String> result=new ArrayList<String