void MirrorTree(Tree t)
{
if (t == NULL || (t->left == NULL&& t->right == NULL))
{
return;
}
Tree temp;
temp = t->left;
t->left = t->right;
t->right = temp;
if (t->left)
MirrorTree(t->left);
if (t->right)
MirrorTree(t->right);
}
二叉树的镜像
最新推荐文章于 2018-11-23 09:57:37 发布