void  InsertListOrder(Nodeptr &Head,Nodeptr G)
{
    Nodeptr  P, Q;
    P = Head;
    while (P != NULL)
    {
    if (strcmp(P->key.tu,G->key.tu)>0) break;
    Q = P;
    P = Q->next;
    }
    if (P == Head)
    {
    G->next = Head;
    Head = G;
    }
    else
    {
    G->next = Q->next;
    Q->next = G;
    }
}