[binarytree_sum] Binary tree sum #python

binarytree_sum.py

def search_path(root):
	if root is None:
		return []
	
	if root.left is None and root.right is None:
		return [root.value]

	return [root.value + val for val in search_path(root.right) 
			+ search_path(root.left)]
  
  
 # or

def calcSum(node, runningSum, sums):
	if node is None:
		return 
	
	newRunningSum = runningSum + node.value
	
	if node.left is None and node.right is None:  #leaf node
		sums.append(newRunningSum)
		return
	
	calcSum(node.left, newRunningSum, sums)
	calcSum(node.right, newRunningSum, sums)