20 lines
384 B
Go
20 lines
384 B
Go
// Package q226 implements a solution for https://leetcode.com/problems/invert-binary-tree/
|
|
package q226
|
|
|
|
type TreeNode struct {
|
|
Val int
|
|
Left *TreeNode
|
|
Right *TreeNode
|
|
}
|
|
|
|
func invertTree(root *TreeNode) *TreeNode {
|
|
if root == nil {
|
|
return nil
|
|
}
|
|
root.Left, root.Right = root.Right, root.Left
|
|
invertTree(root.Left)
|
|
invertTree(root.Right)
|
|
return root
|
|
}
|
|
|
|
var _ = invertTree
|