查找二叉树的节点的父节点

《查找二叉树的节点的父节点》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、#include"stdio.h"#include"malloc.h"#include"process.h"#definemax100typedefstructnode{intdata;structnode*lchild,*rchild;}Bitree;Bitree*a[max];intre[max];Bitree*Build(){intx;intfront,rear;Bitree*t,*s;t=NULL;front=1;rear=0;printf("请输入树以#结束");scanf("%d",&x);w

2、hile(x!=0){s=NULL;if(x!=-1){s=(Bitree*)malloc(sizeof(Bitree));s->data=x;s->lchild=s->rchild=NULL;}rear++;a[rear]=s;if(rear==1)t=s;else{if(s!=NULL&&a[front]!=NULL)if(rear%2==0)a[front]->lchild=s;elsea[front]->rchild=s;if(rear%2==1)front++;}scanf("%d",&x);}re

3、turnt;}voidOutput(inti){intj;printf("祖先节点为:");for(j=0;jdata==u)Output(n);if(t->lchild==NULL&&t->rchild==NULL)return;elsere[n]=t->data;Find(t->l

4、child,u,n+1);Find(t->rchild,u,n+1);}voidmain(){Bitree*t;intu;t=Build();printf("请输入待查找数字:");scanf("%d",&u);Find(t,u,0);printf("查无此数");}