# ---
# title: 257. Binary Tree Paths
# id: problem257
# author: Tian Jun
# date: 2020-10-31
# difficulty: Easy
# categories: Tree, Depth-first Search
# link: <https://leetcode.com/problems/binary-tree-paths/description/>
# hidden: true
# ---
# 
# Given a binary tree, return all root-to-leaf paths.
# 
# **Note:**  A leaf is a node with no children.
# 
# **Example:**
# 
#     
#     
#     Input:
#     
#        1
#      /   \
#     2     3
#      \
#       5
#     
#     Output: ["1->2->5", "1->3"]
#     
#     Explanation: All root-to-leaf paths are: 1->2->5, 1->3
#     
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
