（先序中序）还原二叉树

给定一棵二叉树的先序遍历序列和中序遍历序列，要求计算该二叉树的高度。
输入数据有多组，每组数据第一行输入1个正整数N(1 <= N <= 50)为树中结点总数，随后2行先后给出先序和中序遍历序列，均是长度为N的不包含重复英文字母(区分大小写)的字符串。
输出一个整数，即该二叉树的高度。
9
ABDFGHIEC
FDHGIBEAC

5
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct BTree
{
char data;
struct BTree *lc, *rc;
}BTree, *Tree;
Tree BuildTree(char *pre, char *ino, int n)
{
Tree root;
if(n == 0)
return NULL;
root = new BTree;
root->data = *pre;
int i;
for(i = 0;i < n; i ++)
{
if(ino[i] == pre[0])
break;
}
root->lc = BuildTree(pre+1, ino, i);
root->rc = BuildTree(pre+i+1, ino+i+1, n-i-1);
return root;
}
int Max(int a, int b)
{
if(a > b) return a + 1;
else return b + 1;
}
int deep(Tree &root)
{
int count = 0;
if(root != NULL)
{
int len1 = deep(root->lc);
int len2 = deep(root->rc);
count = Max(len1, len2);
}
return count;
}
int main()
{
int n;
char pre[55], ino[55];
while(~scanf("%d", &n))
{
Tree root;
scanf("%s", pre);
scanf("%s", ino);
root = BuildTree(pre, ino, n);
printf("%d\n", deep(root));
}
return 0;
}