翻转二叉树 如下图所示: 翻转前: 翻转后: struct TreeNode* invertTree(struct TreeNode* root) { if (root == NULL) { return; } struct TreeNode* tmp = root->left; root->left = root->right; root->right = tmp; invertTree(root->left); invertTree(root->right); return root; }