leetcode226-反转二叉树

 public class TreeNode {
     public var val: Int
     public var left: TreeNode?
     public var right: TreeNode?
     public init() { self.val = 0; self.left = nil; self.right = nil; }
     public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
     public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
         self.val = val
         self.left = left
         self.right = right
     }
 }

class Solution {
    //反转二叉树
    func invertTree(_ root: TreeNode?) -> TreeNode? {
//leetcode上的 👍🏻
        guard let rot = root else {
            return nil
        }
        let tmp = rot.left
        rot.left = invertTree(rot.right)
        rot.right = invertTree(tmp)
        return root

//我写的
//        guard let rot = root else {
//            return nil
//        }
//        rot.left = invertTree(rot.left)
//        rot.right =  invertTree(rot.right)
//        let tmp = rot.left
//        rot.left = rot.right
//        rot.right = tmp
//        return root
    }
}