[题目地址](https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/description) ```go /** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func maxLevelSum(root *TreeNode) int { var ans int q := []*TreeNode{root} maxNum := math.MinInt for level := 1; q != nil; level++{ var s int tmp := q q = nil for _, node := range tmp{ s += node.Val if node.Left != nil { q = append(q, node.Left) } if node.Right != nil { q = append(q, node.Right) } } if maxNum < s{ maxNum = s ans = level } } return ans } ```