【leetcode】翻转二叉树

struct TreeNode* invertTree(struct TreeNode* root){
    if(!root) return NULL;
    struct TreeNode* node =root->left;
    root->left=invertTree(root->right);
    root->right=invertTree(node);
    return root;
}