重建二叉树

不写了，写了这么久没保存，网速太慢了。

已知二叉树的前序遍历和中序遍历的结果，重建二叉树。

node pre_order[5]={'a','b','d','c','e'};
char in_order[5]= {'d','b','a','e','c'};
node rebuild[5];
void rebuild_tree(char pre_order[],char in_order[],node rebuild[],int size)
{
    rebuild->m_value=*pre_order;
    rebuild->m_lefttree=NULL;
    rebuild->m_righttree=NULL;
    char* p=in_order;
    int left_size=0;
    while (left_size<size&&*p++!=*pre_order)
    {
        ++left_size;
    }
    ASSERT(left_size<size);
    int right_size=size-left_size-1;
    if (left_size)
    {
        rebuild->m_lefttree=rebuild+1;
        rebuild_tree(pre_order+1,in_order,rebuild+1,left_size);
    }
    if (right_size)
    {
        rebuild->m_righttree=rebuild+left_size+1;
        rebuild_tree(pre_order+left_size+1,in_order+left_size+1,rebuild+left_size+1,right_size);
    }
}