Invert Binary Tree--leetcode

简单递归

func invertTree(root *TreeNode) *TreeNode {
    if(root==nil){return nil}
    temp:=TreeNode{}
    temp.Val=root.Val
    temp.Left=invertTree(root.Right)
    temp.Right=invertTree(root.Left)
    return &temp
}