void insertlast(list *l,adress p,address prec)
{ infotype x;
address q=first(l*);
while(next(q)!=nil){
q=next(q);
}
p=alocate(x);
next(q)=p;
next(p)=nil;
}
void insertafter(list *l,address p,address prec)
{
infotype x;
p=first(*l);
while(next(q)=nil)
{
q=next(q);
}
p=alocate(x);
next(p)=nil;
next(p)=next(prec);
next(prec)=p;
}
void insertFirst (list *l,address p)
{
if(first(*l)==nil)
{
first(*l)=p;
}
else
{
p=alocate(x);
next(p)=nil;
next(p)=first(*l);
first(*l)=p;
}
};
/** Função de registro de usuário **/
void userRegister(user *userList)
{
user *newNode = alocate();
newNode->next = NULL;
if(nullList(userList))
{
userList->next = newNode;
}
else
{
user *tmp = userList->next;
while(tmp->next != NULL)
{
tmp = tmp->next;
}
tmp->next = newNode;
}
tam++;
}
