跳转至

LC226 - 翻转二叉树

Invert.go
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
package BinaryTree

func invertTree(root *TreeNode) *TreeNode {
    if root == nil {
        return root
    }
    leftRet := invertTree(root.Left)
    rightRet := invertTree(root.Right)
    root.Left, root.Right = rightRet, leftRet
    return root
}