数据结构——链表（双向链表）-头插数据

//头插数据
void listtc(listnode* pead, CMMlet n) {
	listnode* ps = listcj();
	listnode* cur = pead->next;
	pead->next = ps;
	ps->prev = pead;
	cur->prev = ps;
	ps->next = cur;
	ps->SZ = n;
}

测试结果