题目:输入一颗二元查找树,将该树转换为它的镜像,即在转换后的二元查找树中,左子树的结点都大于右子树的结点。用递归和循环两种方法完成树的镜像转换。
例如输入:
8
/ \
6 10
/\ /\
5 7 9 11
输出:
8
/ \
10 6
/\ /\
11 9 7 5
定义二元查找树的结点为:
struct BSTreeNode // a node in the binary search tree (BST)
{
int m_nValue; // value of node
BSTreeNode *m_pLeft; // left child of node
BSTreeNode *m_pRight; // right child of node
};
#include <iostream>
#include <queue>using namespace std;
struct BiTree
{
BiTree* left;
BiTree* right;
int value;
};
void InitBiTree(BiTree* &root)
{
int n;
cin>>n;
root=(BiTree*)malloc(sizeof(BiTree));
if (n==0)
{
free(root);
root=NULL;
}
else if(root!=NULL)
{
root->value=n;
InitBiTree(root->left);
InitBiTree(root->right);
}
}
void PreSearch(BiTree* root)
{
if (!root)
{
return;
}
cout<<root->value<<' ';
PreSearch(root->left);
PreSearch(root->right);
}
void ChangeBoth(BiTree* &root)
{
if (root==NULL)
{
return;
}
ChangeBoth(root->left);
ChangeBoth(root->right);
BiTree* t;
t=root->left;
root->left=root->right;
root->right=t;
}
void MirrorRecusively(BiTree* &root)
{
std::queue<BiTree*> BiTreeQueue;
BiTreeQueue.push(root);
while (BiTreeQueue.size())
{
BiTree* pNode=BiTreeQueue.front();
BiTreeQueue.pop();
BiTree* pTemp=pNode->left;
pNode->left=pNode->right;
pNode->right=pTemp;
if (pNode->left)
{
BiTreeQueue.push(pNode->left);
}
if (pNode->right)
{
BiTreeQueue.push(pNode->right);
}
}
}
int main()
{
BiTree *root=NULL;
InitBiTree(root);
PreSearch(root);
cout<<endl;
MirrorRecusively(root);
PreSearch(root);
return 0;
}