Function Problem18

project_euler/problem_18/problem18.go:50–63

(input []string, deep int)

)

func Problem18(input []string, deep int) int {
	tree := &Tree{}

	for _, num := range input {
		v, err := strconv.Atoi(num)
		if err != nil {
			panic(err)
		}

		tree.BFSInsert(NodeValue(v))
	}

	return tree.MaxPathValueSearch(deep)
}