Files
Hot-100-Algorithm/二叉树/翻转二叉树/main.go

21 lines
314 B
Go
Raw Normal View History

2025-08-26 06:18:10 +08:00
package main
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func main() {
}
func invertTree(root *TreeNode) *TreeNode {
if root == nil {
return nil
}
root.Left, root.Right = invertTree(root.Left), invertTree(root.Right)
root.Left, root.Right = root.Right, root.Left
return root
}