buildtree.cpp

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

#include <iostream.h>

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

NODE *build1(char *str,int i,int n)
{
	NODE *p;
	if (i>=n)
		return NULL;
	p=new NODE;
	p->data=str[i];
	p->lchild=build1(str,2*i+1,n);
	p->rchild=build1(str,2*i+2,n);
	return p;
}

NODE *build2(char *str,int i,int j)
{
	NODE *p;
	if (i>j)
		return NULL;
	p=new NODE;
	p->data=str[(i+j)/2];
	p->lchild=build2(str,i,(i+j)/2-1);
	p->rchild=build2(str,(i+j)/2+1,j);
	return p;
}