How do you write linked list program?

Answer 1

a Linked List is a Linear collection of self refrential -class objects, called Nodes that's in General. but if you are using Java You can build it Like That.. http://www.cs.fiu.edu/~weiss/dsj3/code/weiss/nonstandard/LinkedList.java if you are using C++ this Link will be helpful http://richardbowles.tripod.com/cpp/linklist/linklist.htm it covers the ideas of a linked list that what i used (C++,Java) i don know what about C# maybe other contributors can help...

Answer 2

#include<stdio.h>

#include<stdlib.h>

#include<string.h>

#define success 1

typedef unsigned char (INT8U);

typedef signed char (INT8S);

typedef unsigned int (INT16U);

typedef signed int (INT16S);

typedef float (FLOAT);

typedef double (DOUBLE);

struct student{

INT8U Name[20];

INT16U Roll_No;

INT8U Phone_No[14];

struct student *Next;

};

typedef struct student Student_Data_t;

Student_Data_t * Create_Node();

Student_Data_t *p_Head=NULL;

void Begin_Add();

void Mid_AddbyNO();

void Middle_Add();

void End_Add();

void Begin_Delet();

void Mid_DelbyNo();

void Middle_Delet();

void End_Delet();

void Print();

void Reverse();

void Serch();

void Sort();

INT16U length();

/**************************************************************************/

/* CREATE NODE */

/**************************************************************************/

Student_Data_t * Create_Node()

{

Student_Data_t *temp;

INT8U name[20];

INT16U rollno;

INT8U phoneno[14];

printf("\n Enter Student details\n");

printf("\nName : ");

scanf("%s",&name);

printf("\nRoll No : ");

scanf("%d",&rollno);

printf("\nPhone No : ");

scanf("%s",&phoneno);

temp=(Student_Data_t *)malloc(sizeof(Student_Data_t));

strcpy(temp->Name,name);

temp->Roll_No=rollno;

strcpy(temp->Phone_No,phoneno);

temp->Next=NULL;

return temp;

}

/***************************************************************************/

/* INSERT AT BEGIN */

/***************************************************************************/

void Begin_Add()

{

Student_Data_t *p_temp;

p_temp=Create_Node();

if(NULL==p_Head)

{

p_Head=p_temp;

}

else

{

p_temp->Next=p_Head;

p_Head=p_temp;

}

}

/***************************************************************************/

/* INSER AT MIDDLE BY ROLL NO */

/***************************************************************************/

void Mid_AddbyNO()

{

INT16U roll_no;

Student_Data_t *p_temp;

Student_Data_t *p_cur;

Student_Data_t *p_post;

p_cur=p_Head;

if(NULL==p_Head)

{

printf("\n List is empty\n");

}

else

{

if(p_Head->Next==NULL)

{

printf("\n Only one node in list");

p_temp=Create_Node();

}

else

{

printf("Enter Roll No :");

scanf("%d",&roll_no);

//if((p_cur->Roll_No)==(roll_no))

//{

while((p_cur->Roll_No)!=(roll_no))

{

p_cur=p_cur->Next;

}

p_post=p_cur->Next;

p_temp=Create_Node();

p_cur->Next=p_temp;

p_temp->Next=p_post;

//}

//else

//printf("\n Given Roll No is Not found\n");

}

}

}

/***************************************************************************/

/* INSER AT MIDDLE */

/***************************************************************************/

void Middle_Add()

{

INT16U i,loc_l,len_l;

Student_Data_t *p_temp;

Student_Data_t *p_cur;

Student_Data_t *p_prev;

p_cur=p_Head;

len_l=length();

if(NULL==p_Head)

{

printf("\n List is empty\n");

}

else

{

if(p_Head->Next==NULL)

{

printf("\n Only one node in list");

p_temp=Create_Node();

}

else

{

printf("After which node you will ADD node : ");

scanf("%d",&loc_l);

if((loc_l>len_l)(loc_l<=0))

printf("\nInsertion at given location is not possible\n ");

else

{

p_temp=Create_Node();

for(i=1;i<=loc_l;i++)

{

p_prev=p_cur;

p_cur=p_cur->Next;

}

p_prev->Next=p_temp;

p_temp->Next=p_cur;

}

}

}

}

/***************************************************************************/

/* INSERT AT END */

/***************************************************************************/

void End_Add()

{

Student_Data_t *p_temp;

Student_Data_t *p_cur_ptr;

p_temp=Create_Node();

p_cur_ptr=p_Head;

if(NULL==p_Head)

{

p_Head=p_temp;

}

else

{

while(p_cur_ptr->Next!=NULL)

{

p_cur_ptr=p_cur_ptr->Next;

}

p_temp->Next=NULL;

p_cur_ptr->Next=p_temp;

}

}

/***************************************************************************/

/* DELETE AT BEGIN */

/***************************************************************************/

void Begin_Delet()

{

Student_Data_t *cur_ptr;

cur_ptr=p_Head;

if(NULL==p_Head)

{

printf("\n No data to delete\n");

}

else

{

if(cur_ptr->Next==NULL)

{

free(cur_ptr);

p_Head=NULL;

}

else

{

p_Head=p_Head->Next;

free(cur_ptr);

}

}

}

/***************************************************************************/

/* DELETE AT MIDDLE BY ROLL NO */

/***************************************************************************/

void Mid_DelbyNo()

{

INT16U roll_no;

Student_Data_t *p_cur;

Student_Data_t *p_prev;

p_cur=p_Head;

if(p_Head==NULL)

printf("\n List is empty\n");

else

{

if(p_Head->Next==NULL)

{

printf("\n Only One node in list\n");

free(p_cur);

}

else

{

printf("\nEnter roll No : ");

scanf("%d",&roll_no);

if(p_Head->Roll_No==roll_no)

Begin_Delet();

else

{

while(p_cur->Roll_No!=roll_no)

{

p_prev=p_cur;

p_cur=p_cur->Next;

}

p_prev->Next=p_cur->Next;

free(p_cur);

}

}

}

}

/***************************************************************************/

/* DELETE AT MIDDLE */

/***************************************************************************/

void Middle_Delet()

{

INT16U i,loc_l,len_l;

Student_Data_t *p_cur;

Student_Data_t *p_prev;

p_cur=p_Head;

len_l=length();

if(p_Head==NULL)

printf("\n List is empty\n");

else

{

if(p_Head->Next==NULL)

{

printf("\n Only One node in list\n");

free(p_cur);

}

else

{

printf("Which location you want delete : ");

scanf("%d",&loc_l);

if((loc_l>len_l)(loc_l<=0))

printf("\nDeletion of Node at given location is not possible\n ");

else

{

if(loc_l==1)

Begin_Delet();

else

{

for(i=1;i<loc_l;i++)

{

p_prev=p_cur;

p_cur=p_cur->Next;

}

p_prev->Next=p_cur->Next;

free(p_cur);

}

}

}

}

}

/***************************************************************************/

/* DELETE AT END */

/***************************************************************************/

void End_Delet()

{

Student_Data_t *p_cur_ptr;

Student_Data_t *p_temp;

p_cur_ptr=p_Head;

if(NULL==p_Head)

{

printf("\n No data to delete\n");

}

else

{

if(p_cur_ptr->Next==NULL)

{

free(p_cur_ptr);

p_Head=NULL;

}

else

{

while(NULL!=p_cur_ptr->Next)

{

p_temp=p_cur_ptr;

p_cur_ptr=p_cur_ptr->Next;

}

p_temp->Next=NULL;

free(p_cur_ptr);

}

}

}

/***************************************************************************/

/* PRINT */

/***************************************************************************/

void Print()

{

Student_Data_t *p_cur;

if(NULL==p_Head)

printf("\n******** List is empty ******\n");

else

{

p_cur=p_Head;

printf("\n Roll No Name Phone No\n");

while(NULL!=p_cur)

{

//printf("\nRoll No: %d\n",p_Cur_Ptr->Roll_No);

//printf("Name : %s\n",p_Cur_Ptr->Name);

//printf("Phone No : %s\n",p_Cur_Ptr->Phone_No);

printf("\n%d n",p_cur->Roll_No);

printf("%s ",p_cur->Name);

printf("%s ",p_cur->Phone_No);

p_cur=p_cur->Next;

}

}

}

/***************************************************************************/

/* REVERSE */

/***************************************************************************/

void Reverse()

{

Student_Data_t *p_cur;

Student_Data_t *p_temp;

Student_Data_t *p_prev;

p_cur=p_Head;

p_prev=NULL;

while(p_cur!=NULL)

{

p_temp=p_prev;

p_prev=p_cur;

p_cur=p_cur->Next;

p_prev->Next=p_temp;

}

p_Head=p_prev;

}

/***************************************************************************/

/* SEARCH */

/***************************************************************************/

void Serch()

{

INT16U roll_no;

Student_Data_t *p_cur;

p_cur=p_Head;

if(p_Head==NULL)

printf("\n List is empty \n");

else

{

printf("\n Enter Roll No : ");

scanf("%d",&roll_no);

while(p_cur->Roll_No!=roll_no)

{

p_cur=p_cur->Next;

}

printf("\n%d n",p_cur->Roll_No);

printf("%s ",p_cur->Name);

printf("%s ",p_cur->Phone_No);

}

}

/***************************************************************************/

/* SORT */

/***************************************************************************/

void Sort()

{

}

/***************************************************************************/

/* FIND LENGTH */

/***************************************************************************/

INT16U length()

{

INT16U count_l=1;

Student_Data_t *p_Cur_Ptr;

p_Cur_Ptr=p_Head;

if(NULL==p_Head)

{

printf("\nList is empty\n");

}

else

{

while(p_Cur_Ptr->Next!=NULL)

{

p_Cur_Ptr=p_Cur_Ptr->Next;

count_l++;

}

//printf("\nList Length is : %d\n",count_l);

}

return count_l;

}

/***************************************************************************/

/* MAIN */

/***************************************************************************/

void main()

{

INT8U choice;

do

{

printf("\n************ MENU ******************\n");

printf("\n1 Beging Add\n2 Middle Add bu Roll No\n3 middle Add");

printf("\n4 End Add\n5 Begin Delet\n6 Middle Delet by Roll No");

printf("\n7 Middle Delet\n8 End Delet\n9 Print\n10 Reverse");

printf("\n11 Search\n12 Sort\n");

printf("\nEnetr your Choice : ");

scanf("%d",&choice);

switch(choice)

{

case 1: Begin_Add(); break;

case 2: Mid_AddbyNO(); break;

case 3: Middle_Add(); break;

case 4: End_Add(); break;

case 5: Begin_Delet(); break;

case 6: Mid_DelbyNo(); break;

case 7: Middle_Delet(); break;

case 8: End_Delet(); break;

case 9: Print(); break;

case 10: Reverse(); break;

case 11: Serch(); break;

case 12: Sort(); break;

default : printf("\nERROR MESSAGE : Your choice is incorrect\n");

}

}while(1);

}

Answer 3

Use a text editor, or an IDE.