题目:
解题思路:
用递归的方法将二叉树的左右节点互换,核心思想就是交换
源码:
struct TreeNode* invertTree(struct TreeNode* root){
if(root == NULL)
return NULL;
struct TreeNode* tmp = root -> left;
root->left = invertTree(root->right);
root->right = invertTree(tmp);
return root;
}
踩坑点:
一定要判断是否二叉树为空