# Question

Formatted question description: https://leetcode.ca/all/257.html

 257	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"]

@tag-tree


# Algorithm

In the recursive function, when a leaf node is encountered, there is no left or right child node, then a complete path has been formed at this time, add the current leaf node and save it in the result, and then backtrack.

Java