-
Notifications
You must be signed in to change notification settings - Fork 0
/
637.go
71 lines (59 loc) · 1.39 KB
/
637.go
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
/*
# ------------------------------ #
# #
# version 0.0.1 #
# #
# Aleksiej Ostrowski, 2023 #
# #
# https://aleksiej.com #
# #
# ------------------------------ #
*/
package main
import (
"fmt"
)
/**
* Definition for a binary tree node.
**/
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func averageOfLevels(root *TreeNode) []float64 {
crn := make(map[int][]float64)
type Thelper_averageOfLevels func(root *TreeNode, level int)
var helper_averageOfLevels Thelper_averageOfLevels
helper_averageOfLevels = func(root *TreeNode, level int) {
if root == nil {
return
}
crn[level] = append(crn[level], float64(root.Val))
helper_averageOfLevels(root.Left, level+1)
helper_averageOfLevels(root.Right, level+1)
}
helper_averageOfLevels(root, 0)
otv := make([]float64, len(crn))
for level, el := range crn {
len_el := float64(len(el))
if len_el < .5 {
continue
}
sm := float64(0)
for _, e := range el {
sm += e
}
otv[level] = sm / len_el
}
return otv
}
func main() {
tree4 := &TreeNode{15, nil, nil}
tree5 := &TreeNode{7, nil, nil}
tree3 := &TreeNode{20, tree4, tree5}
tree2 := &TreeNode{9, nil, nil}
tree := &TreeNode{3, tree2, tree3}
fmt.Println(averageOfLevels(tree))
fmt.Println("ok")
}