LeetCode刷题实战257：二叉树的所有路径-技术圈

算法的重要性，我就不多说了吧，想去大厂，就必须要经过基础知识和业务逻辑面试+算法面试。所以，为了提高大家的算法能力，这个公众号后续每天带大家做一道算法题，题目就从LeetCode上面选！

今天和大家聊的问题叫做 二叉树的所有路径，我们先来看题面：

https://leetcode-cn.com/problems/binary-tree-paths/

Given the root of a binary tree, return all root-to-leaf paths in any order.
A leaf is a node with no children.

给定一个二叉树，返回所有从根节点到叶子节点的路径。说明: 叶子节点是指没有子节点的节点。

解题

/**
 * 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> list = new LinkedList<>();
        helper(root, "", list);
        return list;
    }
    
    private void helper(TreeNode root, String s, List<String>list){
        if (root == null){
            return;
        }
        
        s = s + root.val;
        
        if (root.left == null && root.right == null){
            list.add(s);
            return;
        }
        
        if (root.left != null){
            helper(root.left, s + "->", list);
        }

        if (root.right != null){
            helper(root.right, s + "->", list);
        }
    }
 
    
 
}