二叉树重建

#include<iostream>
using namespace std;
class TreeNode
{public:
char value;
TreeNode *left;
TreeNode *right;
TreeNode(char c) : value(c){
left = NULL;
right = NULL;
}
~TreeNode() {
if (left != NULL) delete left;
if (right != NULL) delete right;
}
};
TreeNode* buildTree(char *pre, char *mid, int n)
{
if (n == 0) return NULL;


char c = pre[0];
TreeNode *node = new TreeNode(c); 
int i;
for (i = 0; i<n && mid[i] != c; i++);
int lenL = i; 
int lenR = n - i - 1; 

if (lenL > 0) node->left = buildTree(&pre[1], &mid[0], lenL);

if (lenR > 0) node->right = buildTree(&pre[lenL + 1], &mid[lenL + 1], lenR);
return node;
}


TreeNode* show(TreeNode*T)//先序遍历二叉树
{
if (T == NULL)
  return 0;

cout << T->value;
if(T->left!=NULL)
show(T->left);
if(T->right!=NULL)
   show(T->right);

}
int main()
{
char pre[] = "DBACEGF";//先序遍历
char mid[] = "ABCDEFG";//后序遍历
TreeNode *head=buildTree(pre, mid, 7);//重建二叉树
show(head);
return 0;
}