codingPython/minMaxSumInTree.py at master · kathan24/codingPython · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
__author__ = 'kathan'

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


def minSum(node, sum):
    if node is None:
        return sum

    left_sum = minSum(node.left, node.value + sum)
    right_sum = minSum(node.right, node.value + sum)

    if left_sum < right_sum:
        return left_sum
    else:
        return right_sum


def maxSum(node, sum):
    if node is None:
        return sum

    left_sum = maxSum(node.left, node.value + sum)
    right_sum = maxSum(node.right, node.value + sum)

    if left_sum < right_sum:
        return right_sum
    else:
        return left_sum


root = Node(15)
root.left = Node(10)
root.right = Node(20)

root.left.left = Node(6)
root.left.right = Node(7)

root.left.right.left = Node(2)
root.left.right.right = Node(16)

root.left.right.left.left = Node(0)
root.left.right.left.right = Node(5)

root.left.right.right.left = Node(3)

root.right.left = Node(22)


print "Min: " + str(minSum(root, 0))
print "Max: " + str(maxSum(root, 0))