问题描述:
翻转一棵二叉树
思路:
递归翻转,主要是swap(类似于交换两个变量)
AC:
struct TreeNode* invertTree(struct TreeNode* root){
if(root == NULL)
{
return NULL;
}
//swap
struct TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
invertTree(root->left);
invertTree(root->right);
return root;
}
翻转二叉树
最新推荐文章于 2024-05-09 15:44:08 发布