假设二叉树中每个节点值为单个字符,采用二叉链存储结构存储。设计一个算法求二叉树b中指定值为x的节点的双亲节点p,提示:根节点的双亲为NULL,若在b中未找到值为x的节点,p亦为NULL,并假设二叉树中所有节点值是唯一的。
#include <iostream>
#include <stdlib.h>
using namespace std;
const int MaxSize=100;
typedef struct node
{
char data;
struct node *lchild,*rchild;
}BTNode;
void CreatBTNode(BTNode *&b,char *str) //创建二叉树
{
BTNode *St[MaxSize],*p;
int top=-1,k,j=0;
char ch;
b=NULL;
ch=str[j];
while(ch!='\0')
{
switch(ch)
{
case'(':top++;
St[top]=p;
k=1;
break;
case')':top--;
break;
case',':k=2;
break;
default:
p=(BTNode *)malloc(sizeof(BTNode));
p->data=ch;
p->lchild=p->rchild=NULL;
if(b==NULL) b=p;
else
{
switch(k)
{
case 1:St[top]->lchild=p; break;
case 2:St[top]->rchild=p; break;
}
}
}
j++;
ch=str[j];
}
}
BTNode *findparent(BTNode *b,char x) //求双亲节点
{
cout<<b->lchild->data<<" "<<b->rchild->data<<endl;
BTNode *p;
if(b==NULL) return NULL;
else if(b->lchild->data==x||b->rchild->data==x) return b;
else
{
p=findparent(b->lchild,x);
if(p==NULL) return findparent(b->rchild,x);
}
}
int main()
{
BTNode *b,*p,*t;
char ch='G';
char str[100]="A(B(D,E),C(F,G))";
CreatBTNode(b,str);
t=findparent(b,ch);
cout<<t->data;
return 0;
}