Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0201_0300.s0257_binary_tree_paths.Solution

```
public class Solution
extends Object
```
257 - Binary Tree Paths.
Easy

Given the root of a binary tree, return all root-to-leaf paths in any order.

A leaf is a node with no children.

Example 1:

Input: root = [1,2,3,null,5]

Output: [“1->2->5”,“1->3”]

Example 2:

Input: root = [1]

Output: [“1”]

Constraints:
- The number of nodes in the tree is in the range [1, 100].
- -100 <= Node.val <= 100

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<String> binaryTreePaths(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

binaryTreePaths

public List<String> binaryTreePaths(TreeNode root)