单链表的插入

//假设顺序为从小到大
Node * Insert(Node* head,int e)
{
Node* q = head;
Node* p = (Node*)malloc(sizeof(Node));
p->data = e;

while((e<q->data) && NULL != q->next)
{
q=q->next;
}

if(NULL == q->next)
{
q->next = p;
p->next = NULL;

}
else
{
p->next = q->next;
q->next = p;
}

return head;
}