LeetCode Invert Binary Tree
题目
思路
没什么思路可言;
真不敢相信他写不出;
代码
struct TreeNode* invertTree(struct TreeNode* root) {
if (root == NULL) return root;
invertTree(root->left);
invertTree(root->right);
struct TreeNode * temp = root->left;
root->left = root->right;
root->right = temp;
return root;
}