Branch Sums

class BinaryTree:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

def getSum(root, result, curr): 
    if not root.left and not root.right:
        result.append(curr) 
    #curr += root.val 
    if root.left:
        getSum(root.left, result, curr+root.left.value) 
    if root.right:
        getSum(root.right, result, curr+root.right.value) 
    return result 
def branchSums(root):
    if not root:
        return [] 
    return getSum(root, [], root.value)