#include "iostream"
using namespace std;
struct BinaryTreeNode{
int data;
BinaryTreeNode *left;
BinaryTreeNode *right;
};
void mirrorRecursively(BinaryTreeNode *pNode)
{
if ((pNode == NULL) || (pNode->left == NULL&&pNode->right == NULL))
return;
BinaryTreeNode *pTemp = pNode->left;
pNode->left = pNode->right;
pNode->right = pTemp;
if (pNode->left)
mirrorRecursively(pNode->left);
if (pNode->right)
mirrorRecursively(pNode->right);
}
int main()
{
system("pause");
return 0;
}
剑指offer面试题19:二叉树的镜像
最新推荐文章于 2022-05-12 15:25:23 发布