单链表的基本操作

源码如下：

#include<iostream>
using namespace std;

typedef struct tnode
{
	int data;
	struct tnode *next;
}node;

node *create()
{
	node *head,*p,*s;
	int x;
	int cycle=1;
	head=(node*)malloc(sizeof(node));
	p=head;
	while(cycle)
	{
		printf("\nplease input the data:");
		scanf("%d",&x);
		if(x!=0)
		{
			s=(node*)malloc(sizeof(node));
			s->data=x;
			printf("\n%d",s->data);
			p->next=s;
			p=s;
		}
		else cycle=0;
	}
	
	head=head->next;
	p->next=NULL;
	printf("\n%d",head->data);
	return(head);
}

int length(node *head)
{
	int n;
	node *p;
	p=head;
	while(p!=NULL)
	{
		p=p->next;
		n++;
	}
	return(n);
}

void print(node *head)
{
	node *p;
	p=head;
	while(p!=NULL)
		{
			printf("\n%d",p->data);
			p=p->next;
		}
}

node *del(node *head,int num)
{
	node *p1,*p2;
	p1=head;

	while(num!=p1->data&&p1->next!=NULL)
	{
		p2=p1;
		p1=p1->next;
	}

	if(num==p1->data)
	{
		if(p1==head)
		{
			head=p1->next;
			free(p1);
		}
		else
		{
			p2->next=p1->next;
		}
	}
	else
		printf("\n%d could not been found",num);
	return(head);
}

node *insert(node *head,int num,int m)
{
	node *p0,*p1,*p2;
	p1=head;
	p2=head;
	p0=(node*)malloc(sizeof(node));
	p0->data=num;
	int i;
	for(i=0;i<m;i++)
	{
		p1=p1->next;
	}
	for(i=0;i<m-1;i++)
	{
		p2=p2->next;
	}
	p2->next=p0;
	p0->next=p1;

	return(head);
}

node *sort(node *head)
{
	char temp;
	node *p,*q,*end;
    p=head->next;
    q=p->next;
	while(end!=head->next)
	 {
		p=head->next;
		q=p->next;
		while(p->next!=end)
			{
				if(p->data>q->data)
					{   
						temp=p->data;
						p->data=q->data;
						q->data=temp;
					}
					p=q;
					q=p->next;
			}
        end=p;
	}
   return head;

} 

int main()
{
	node *head;
	int n;
	int x;
	int del_num;
	int insert_num;
	head=create();
	print(head);
	cout<<"\nafter sort,the linkedlist is:";
	head=sort(head);
	print(head);
	cout<<"\nplease input the delete data:";
	cin>>del_num;
	head=del(head,del_num);
	print(head);
	cout<<"\nplease input the insert data:";
	cin>>insert_num;
	cout<<"\nplease input the position:";
	cin>>x;
	head=insert(head,insert_num,x);
	print(head);
	return 0;
}

 

 运行结果：