-
Notifications
You must be signed in to change notification settings - Fork 5
/
MaxLevelSum.py
75 lines (61 loc) · 1.74 KB
/
MaxLevelSum.py
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
# Problem Description: https://practice.geeksforgeeks.org/problems/max-level-sum-in-binary-tree/1
class Node:
def __init__(self, value):
self.data = value
self.left = None
self.right = None
class Tree:
def createNode(self, data):
return Node(data)
def insert(self, node, data, ch):
if node is None:
return self.createNode(data)
if (ch == 'L'):
node.left = self.insert(node.left, data, ch)
return node.left
else:
node.right = self.insert(node.right, data, ch)
return node.right
def search(self, lis, data):
# if root is None or root is the search data.
for i in lis:
if i.data == data:
return i
def maxLevelSum(root):
if(not root):
return(0)
result = root.data
q = []
q.append(root)
while(q != []):
total = 0
for _ in range(len(q)):
temp = q[0]
del q[0]
total += temp.data
if(temp.left):
q.append(temp.left)
if(temp.right):
q.append(temp.right)
result = max(total, result)
return(result)
if __name__ == '__main__':
t = int(input())
for i in range(t):
n = int(input())
arr = input().strip().split()
if n == 0:
print(1)
continue
tree = Tree()
lis = []
root = None
root = tree.insert(root, int(arr[0]), 'L')
lis.append(root)
k = 0
for j in range(n):
ptr = None
ptr = tree.search(lis, int(arr[k]))
lis.append(tree.insert(ptr, int(arr[k+1]), arr[k+2]))
k += 3
print(maxLevelSum(root))