会还原吗？

题目链接

先利用前序和中序序列建树，再利用二叉树遍历得到树的高度

#include<iostream>
using namespace std;

typedef struct BTNode {
	char c;
	BTNode* left;
	BTNode* right;
}*BTree;

BTree CreateBT(char a[], char b[], int N)
{
	if (N == 0)
		return NULL;
	BTree t = new BTNode;
	t->c = a[0];
	int mid;
	for (mid = 0; mid < N; ++mid)
	{
		if (b[mid] == a[0])
			break;
	}
	t->left = CreateBT(a+1,b,mid);
	t->right = CreateBT(a+mid+1,b+mid+1,N-mid-1);
	return t;
}

void InOrder(BTree T)
{
	if (T)
	{
		InOrder(T->left);
		cout << T->c;
		InOrder(T->right);
	}
}

int BinaryTreeHeight(BTree T)
{
	int BTreeHeight = 0;
	if (T)
	{
		int LeftHeight = BinaryTreeHeight(T->left);
		int RightHeight = BinaryTreeHeight(T->right);
		BTreeHeight = LeftHeight >= RightHeight ? LeftHeight + 1 : RightHeight + 1;
	}
	return BTreeHeight;
}

int main()
{
	int N;
	cin >> N;
	//a前序    b中序
	char* a = new char[N];
	char* b = new char[N];
	for (int i = 0; i < N; ++i)
		cin >> a[i];
	for (int i = 0; i < N; ++i)
		cin >> b[i];
	BTree T = CreateBT(a, b, N);
	//InOrder(T);
	cout << BinaryTreeHeight(T);
	return 0;
}