`## 在有序链表中插入一个数,并使它仍是个有序表
LinkList* Push(LinkList* head,int val)
{
LinkList* newnode,cur;
newnode = (struct LinkList)malloc(sizeof(LinkList));//建立一个新节点
newnode->data = val;
newnode->next = NULL;
cur = head;
while(cur->next != NULL&&cur->next->data < val)
{
cur = cur->next;
}
newnode->next = cur->next;
cur->next = newnode;
return head;
}
10-11
1万+
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)