二叉树5（复制二叉树）

# include <stdio.h>
# include <stdlib.h>
typedef char ElemType;
typedef struct BiTNode{
ElemType data;
struct BiTNode* Lchild;
struct BiTNode* Rchild;
}BiTNode,*BiTree;
//构造二叉树
void createbt(BiTree &T){
char ch;
scanf("%c",&ch);
if(ch=='#')T=NULL;
else{
T=(BiTree)malloc(sizeof(BiTNode));
T->data=ch;
createbt(T->Lchild);
createbt(T->Rchild);
}
}
//复制一棵二叉树
BiTNode *GetTreeNode(ElemType item,BiTNode*lptr,BiTNode*rptr){
//生成一个其元素值为item,左指针为lptr，右指针为rptr的节点
BiTNode *T;
T=(BiTree)malloc(sizeof(BiTNode));
T->data=item;
T->Lchild=lptr;
T->Rchild=rptr;
return T;
}
BiTNode *CopyTree(BiTNode*T){
//已知二叉树的根指针为T，本算法返回他的复制品的根指针。
struct BiTNode *newlptr,*newrptr;
BiTNode *newnode;
if(!T)return NULL;
if(T->Lchild)
newlptr=CopyTree(T->Lchild);
else
newlptr=NULL;
if(T->Rchild)
newrptr=CopyTree(T->Rchild);
else
newrptr=NULL;
newnode=GetTreeNode(T->data,newlptr,newrptr);
return newnode;
}
//中序遍历
void Inorder(BiTree T){
if(T){
Inorder(T->Lchild);
printf("%c ",T->data);
Inorder(T->Rchild);
}
}
void main(){
int depth=0;
BiTree T;
BiTree T0;
printf("create a tree such as ABC##de#G##f###\n");
createbt(T);
printf("print T\n");
Inorder(T);
    T0=CopyTree(T);
printf("\nprint T0\n");
Inorder(T0);
}