shu

include<stdio.h>

include<stdlib.h>

define maxsize 20

typedef char TElemType;
typedef struct node{
char data;
struct node lchild,rchild;
}BiTNode,BinTree;
void createBinTree(BiTNode &S,TElemType pre[],int &i){ //构建二叉树
TElemType ch=pre[i++]; // 读入一个结点的数据
if(ch==';') return; //结束
if(ch!='#'){
S=(BiTNode)malloc(sizeof(BiTNode)); //创建根节点
S->data=ch;
createBinTree(S->lchild,pre,i); //递归建立左右孩子
createBinTree(S->rchild,pre,i);
}else{
S=NULL; //空子树
}
}
void PrintfBintree(BiTNode T) { //用广义表输出二叉树,先序序列
if(T!=NULL) {
printf("%c",T->data);
if(T->lchild!=NULL||T->rchild!=NULL) {
printf("(");
PrintfBintree(T->lchild); //递归
printf(",");
PrintfBintree(T->rchild);
printf(")");
}
}
}
void PrintfLeafNode(BinTree t,int &k){
if(t==NULL) return;
if(t->lchild==NULL&&t->rchild==NULL){
k++;
printf("%c",t->data);
}
PrintfLeafNode(t->lchild,k); //左右孩子都走一遍
PrintfLeafNode(t->rchild,k);
}
BiTNode getParent(BiTNode t,BiTNode p){ //得到父节点
if(t==NULL) return NULL;
if(t==p) return NULL;
if(t->lchild!=NULL&&t->lchild->data==p->data||t->rchild!=NULL&&t->rchild->data==p->data) return t;
BiTNode s=getParent(t->lchild,p);
if(s!=NULL) return s;
else return getParent (t->rchild,p);
}
void printfChild(BiTNode t){
if(t==NULL) return;
printf("%c",t->data);
printfChild(t->lchild);
printfChild(t->rchild);
}
BiTNode Search(BiTNode t,BiTNode p){
if(t==p) return NULL;
if(t->data==p->data) return t;
BiTNode *s=Search(t->lchild,p);
if(s!=NULL) return s;
else return Search(t->rchild,p);

}
int main(){
BinTree tree,parent,child;
char ch[maxsize];
int i,n=0,k=0,j;
printf("请给赋值二叉树:\n");
for(i=0;i<maxsize;i++){
scanf("%c",&ch[i]);
if(ch[i]=='\n') break;
}
createBinTree(tree,ch,n);
printf("用广义表输出二叉树为:\n");
PrintfBintree(tree);
printf("\n");
printf("叶子结点为：\n");
PrintfLeafNode(tree,k);
printf("\n");
printf("叶子结点个数为：%d",k);
printf("\n");
printf("请输入任意结点：");
parent=(BiTNode) malloc(sizeof(BiTNode));
scanf("%c",&parent->data);
printf("双亲结点为：%c",getParent(tree,parent)->data);
printf("\n");
child=(BiTNode) malloc(sizeof(BiTNode));
printf("请输入任意结点：");
getchar();
scanf("%c",&child->data);
printf("孩子结点为：");
child=Search(tree,child);
printfChild(child);
}

转载于:https://www.cnblogs.com/isudh5554537/p/10984132.html