链表（实现插入一个数）

#include<bits/stdc++.h>

using namespace std;

struct node{
	int date;
	struct node *next;
};

int main(){
	struct node *head,*p,*q,*t;
	int n;
	cin>>n;
	head = NULL;
	int a; 
	for(int i=1;i<=n;i++){
 		cin>>a;
 		p = (struct node *)malloc(sizeof(struct node));
 		p->date = a;
 		p->next = NULL;
 		if(head == NULL) head = p;
 		else q->next = p;
 		
 		q=p;
	}
	cin>>a;//读入待插入的数
	t = head;
	while(t!=NULL){
		if(t->next->date > a){
			p = (struct node *)malloc(sizeof(struct node));
			p -> date = a;
			p -> next = t->next;
			t -> next = p;
			break;
		}
		t = t->next;
	}
	t = head;
	while(t!=NULL){
		cout << t->date<<" ";
		t = t -> next;
	} 
	return 0;
}