<c艹复健期间 改用c艹刷leetcode>
Invert Binary Tree
Problem Description
Solution
遍历树的话就前序遍历,先访问根节点再左子树然后右子树。对左右节点进行交换,就设一个中间量然后互换。(emmmmm好像没啥好说的就这样
void swap(TreeNode *curr) {
if(!curr)
return;
swap(curr->left);
swap(curr->right);
TreeNode *temp;
temp = curr->left;
curr->left = curr->right;
curr->right = temp;
}