(root *TreeNode)
| 16 | } |
| 17 | |
| 18 | func dfs(root *TreeNode) BalanceTree { |
| 19 | if root == nil { |
| 20 | return BalanceTree{true, 0} |
| 21 | } |
| 22 | |
| 23 | left, right := dfs(root.Left), dfs(root.Right) |
| 24 | balanced := (left.Balance && right.Balance && int(math.Abs(float64(left.Height)-float64(right.Height))) <= 1) |
| 25 | |
| 26 | return BalanceTree{balanced, 1 + max(left.Height, right.Height)} |
| 27 | } |
| 28 | |
| 29 | func max(a, b int) int { |
| 30 | if a > b { |