dasda

void BinaryTreeFromOrderings(char* inorder,char* preorder,int length)
{
    if(preorder->left == NULL)
    {
        return;
    }
    TreeNode* node = new TreeNode;//Noice that [new] should be written out.
    node->elem = *preorder;
    int rootIndex = 0;
    for(; rootIndex < length; rootIndex++)
    {
        if(inorder[rootIndex] == *preorder)
            break;
    }
    ...........................................................//Left
    BinaryTreeFromOrderings(inorder,preorder+1,rootIndex);

    //Right
    BinaryTreeFromOrderings(inorder + rootIndex + 1,preorder + rootIndex + 1,length - (rootIndex + 1));

    cout<<node->elem<<endl;

    return;
}