LeetCode 226.翻转二叉树

var invertTree = function(root) {
    if(!root) return null
    
    const temp = root.left
    root.left = root.right
    root.right = temp

    invertTree(root.left)
    invertTree(root.right)
    
    return root
};

ES6

var invertTree = function(root) {
    if(!root){
        return null
    }else{
        [root.left, root.right] = [invertTree(root.right),invertTree(root.left)]
        return root
    }
};