leetcode 226. Invert Binary Tree

    TreeNode* invertTree(TreeNode* root) {
        if (root == NULL) return NULL;
        
        auto temp = root->left;
        root->left = root->right;
        root->right = temp;
        invertTree(root->left);
        invertTree(root->right);
        return root;
    }