[Leetcode] Binary tree-- 113. 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.

For 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]
]

Solution:

 Here I use iterative way,  BFS search

 record the node and the path node value starting from its parent to itself while traversing

if root is None:
            return []
        
        d = []
        s = sum
        innerLst = [root.val]
        ansLst = []
        d.append((root, innerLst))
        while (len(d)):
            nodeInfo = d.pop(0)
            node = nodeInfo[0]
            innerLst = nodeInfo[1]
            if not node.left and not node.right:
                #print ("innerLst: ", innerLst, s, type(innerLst))
                #sumPath = sum(innerLst)
                sumPath = 0
                for e in innerLst:
                    sumPath+=e
                if sumPath == s:
                    ansLst.append(innerLst)
            if node.left:
                d.append((node.left, innerLst + [node.left.val]))
            if node.right:
                d.append((node.right, innerLst + [node.right.val]))
        return ansLst