# ---
# title: 113. Path Sum II
# id: problem113
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Tree, Depth-first Search
# link: <https://leetcode.com/problems/path-sum-ii/description/>
# hidden: true
# ---
# 
# Given a binary tree and a sum, find all root-to-leaf paths where each path's
# sum equals the given sum.
# 
# **Note:**  A leaf is a node with no children.
# 
# **Example:**
# 
# Given the below binary tree and `sum = 22`,
# 
#     
#     
#           **5**
#          **/ \**
#         **4   8**
#        **/**   / **\**
#       **11**  13  **4**
#      /  **\**    **/** \
#     7    **2**  **5**   1
#     
# 
# Return:
# 
#     
#     
#     [
#        [5,4,11,2],
#        [5,8,4,5]
#     ]
#     
# 
# 
## @lc code=start
using LeetCode

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