二叉树的构造代码

先中序遍历构造二叉树

BTNode* CreateBT1(char* pre, char* in, int n)
{
	BTNode* b;
	char* p;
	int k;
	if (n <= 0)return NULL;
	b = (BTNode*)malloc(sizeof(BTNode));
	b->data = *pre;
	for (p = in; p < in + n; p++)
		if (*p == *pre)
			break;
	k = p - in;
	b->lchild = CreateBT1(pre + 1, in, k);
	b->rchild = CreateBT1(pre + k + 1, p + 1, n - k - 1);
	return b;
}

中后序遍历构造二叉树

BTNode* CreateBT2(char* post, char* in, int n)
{
	BTNode* b;
	char* p;
	int k;
	if (n <= 0)return NULL;
	r = *(post + n - 1);

	b = (BTNode*)malloc(sizeof(BTNode));
	b->data = r;
	for (p = in; p < in + n; p++)
		if (*p ==r)
			break;
	k = p - in;
	b->lchild = CreateBT2(post, in, k);
	b->rchild = CreateBT2(post+k ,p + 1, n - k - 1);
	return b;
}