human
I found an interesting problem on https://leetcode.com/problems/path-sum-ii/:
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]
]

I tried it in Python, but could not do it. Can you solve it?

What is a Python code to find all root-to-leaf paths where each path's sum equals the given sum?
assistant
#Here is Python code to find all root-to-leaf paths where each path's sum equals the given sum.

# Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, x):
 #         self.val = x
 #         self.left = None
 #         self.right = None
 
 class Solution:
     def pathSum(self, root, sum):
         """
         :type root: TreeNode
         :type sum: int
         :rtype: List[List[int]]
         """
         if root is None:
             return []
         if not (root.left or root.right) and root.val == sum:
             return [[root.val]]
         return [[root.val]+ans for ans in self.pathSum(root.left,sum-root.val)+self.pathSum(root.right,sum-root.val)]