restore.cpp

常用算法与数据结构原代码

#include <iostream.h>

typedef struct node
{
	char data;
	node *lchild;
	node *rchild;
} NODE;

NODE *restore(char *pstr,char *istr,int n)
{
	NODE *ptr;
	char *rstr;
	int k;
	if(n<=0)
		return NULL;
	ptr=new NODE;
	ptr->data=*pstr;
	for(rstr=istr;rstr<istr+n;rstr++)
		if(*rstr==*pstr)
			break;
	k=rstr-istr;
	ptr->lchild=restore(pstr+1,istr,k);
	ptr->rchild=restore(pstr+k+1,rstr+1,n-k-1);
	return ptr;
}