-
Notifications
You must be signed in to change notification settings - Fork 0
/
binaryTree.py
47 lines (35 loc) · 805 Bytes
/
binaryTree.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
class Node():
def __init__(self, val, left, right):
self.val = val
self.left = left
self.right = right
def collect(node, data, depth = 0):
if not node:
return None
if depth not in data:
data[depth] = []
data[depth].append(node.val)
collect(node.left, data, depth + 1)
collect(node.right, data, depth + 1)
return None
def avgByDepth(node):
data = {}
result = []
collect(node, data)
i = 0
while i in data:
nums = data[i]
avg = sum(nums) / len(nums)
result.append(avg)
i += 1
return result
n8 = Node(2, False, False)
n7 = Node(6, n8, False)
n6 = Node(6, False, False)
n5 = Node(2, False, n7)
n4 = Node(10, False, False)
n3 = Node(9, n6, False)
n2 = Node(7, n4, n5)
n1 = Node(4, n2, n3)
finalResult = avgByDepth(n1)
print(finalResult)