Operations on single-chain lists

1.First, we should know how to create a single-chain list.

   We can read   a  book to acquire answers.  Here, I recommend a book. Its name is Data structure as described in C language.

   Now, I will introduce two methods to create a single-chain list: the first method is head insertion. We can write some code segments like s->next = head->next;   head->next = s;

    where "s" is the new node , the "head" is  the first node of a single-chain list ;

    Then, we can write some C++ language codes to implement a single-chain list,

    If we want to implement the routine, we need to finish some steps;

   First step: we need to initialize a single-chain list 

  The implementation code is as follows:

typedef struct Node{
	 int  data;  //
	struct Node* next;  //
}Node,*linklist;   // 
 



void InitList(linklist *L)
{
	*L = (linklist)malloc(sizeof(Node));  
	(*L)->next = NULL;  
	 
 } 

   Second step:Create a list

   

   

void CreateFromHead(linklist L)
{  
     Node *s;
                        
	 char c;
	 
	 int flag = 1;
	 while(flag)  
	 {
	 //	cout<<"enter data:"<<endl; 
	 	//c = getchar();
	 	 cin >> c;
		 if(c!='$')
		 {
		 	s = (Node*)malloc(sizeof(Node)); 
			s->data = c - '0';  // and translation char to int
			s->next = L->next;  //
			L->next = s;   // 
		} 
		else flag = 0; //
	  } 
 } 

If we need to use the second tailing method:

We only need to change some code segments. First, we can change "s->next = L->next; "   to  "L->next = s;" second, we need to change "L->next = s;" to " L = s; ", this implements the tail method insertion method.

2. Now, we have mastered the most basic operation, but we know there are some interesting operations from the book, such as inserting 、search value by se