计算机软件技术基础的实验代码

{
node *p1,*p2;
if(head==NULL){
cout<<"链表为空,无结点可删!\n";
return(NULL);
}
if (head->data==num){
while(p2->data!=num&&p2->next!=NULL){
p1=p2;
p2=p2->next;
}
if (p2->data==num){
if(head==NULL){
cout<<"链表为空,无结点可删!\n";
return(NULL);
}
d;
head=head->next;
}
//函数insert(node *head,int num) 实现把一个结点插入链表，仍保持链表上各结
点的升序关系，你自己实现
void main(void)
{
node *head;
int num;
int k;
head= create_sort ();
n=n+1;
p=p->next;
}
return(n);
}
//删除链表上第k 个结点
node *delete_k_node(node *head,int k)
{
int j=1;
node *p,*p1;
p1->next=p2->next;
delete p2;
cout<<"删除了一个结点!\n";
}
else cout<<num<<"链表上没找到要删除的结点!\n";
while(p!=NULL){
cout<<p->data<<'\t';
p=p->next;
}
cout<<'\n';
}
//删除链表上具有指定值的一个结点
node *delete_one_node(node *head,int num)
}
return(head);
}
//释放链表的结点空间
void deletechain(node *h)
{
node *p1;
while(h){
p1=h;
h=h->next;
delete p1;
cout<<"输入要删除结点上的整数!\n";
cin>>num;
head=delete_one_node(head,num);
print(head);
deletechain(head);
cout<<"输入要插入的整数!\n"
cin>>num;
#include <iostream.h>
struct node{
int data;
node *next;
};
//建立一条有序链表
node *create_sort(void)
{
node *p1,*head=0;
p1=head;
head=head->next;
delete p1;
cout<<"删除了一个结点!\n";
}
else{
p2=p1=head;
cin>>a;
}
return(head);
}
//输出链表上各个结点的值
void print(const node *head)
{
const node *p;
p=head;
cout<<"链表上各个结点的数据为:\n";
{
p1=p->next;
p->next=p1->next;
delete p1;
cout<<"删除了第"<<k<<"个结点!\n";
}
return(head);
delete p;
cout<<"删除了第一个结点!\n";
}
else{
p=find(head,k-1); //查找第k-1 个结点,并由p 指向该结点
if (p->next!=NULL)
head=insert(head, num)；
print(head);
}
}
cout<<"已释放链表的结点空间!\n";
}
int count(node *head)//求链表的结点数
{
int n;
node *p;
p=head;
n=0;
while(p!=NULL){
print(head);
cout<<"结点数:"<<count(head)<<"\n";
cout<<"输入要删除结点上的序号!\n";
cin>>num;
head=delete_k_node(head,k);
print(head);
int a;
cout<<"建立一条有序链表,请输入数据,以-1 结束:";
cin>>a;
while(a!=-1){
p1=new node;
p1->data=a;
head=insert(head,p1);