Question
In: Computer Science
Allow the InsertAt method to add to the front position 0 (zero) also if you try...
Allow the InsertAt method to add to the front position 0 (zero)
also if you try to add to a position greater than the number of nodes you get an error warning.
Please do through this order. Thanks
--> I need you to add more than 2 front position.
// 1 LOAD THE LIST FROM DATA.BIN //buildlist
// 2 DISPLAY THE LIST //prntlist
// 3 ADD TO THE LIST // listinsert
// 4 DELETE FROM THE LIST // listdelete
// 5 EXIT
//INSERT.C
/*THIS PROGRAM READS A BINARY FILE (MUST ALREADY EXIST AND BE FILLED) */
/*AND PUTS IT INTO A LINKED LIST AND PRINTS THE LIST TO THE SCREEN) */
#include
#include
#include
#include
#include
typedef struct ENTRY
{
char name[81];
}ENTRY;
typedef struct LISTREC /* LISTREC is a user-defined type, defined */
{ /* before main so it will be global */
struct ENTRY info; /* info nests all fields contained in */
struct LISTREC *link; /* ENTRY (above). */
}LISTREC; /* link is a pointer variable to another */
/* type LISTREC. NOTE: Name of type MUST */
/* be entered at end of typedef */
FILE *stream;
ENTRY part;
//prototypes !!!!
void listdelete(ENTRY part,LISTREC *liststart);
LISTREC *buildlist();
void prntlist(LISTREC *);
void listinsert(ENTRY,LISTREC *);
LISTREC * InsertAt(LISTREC *, ENTRY ,int );
void main()
{
LISTREC *liststart; /*holds a pointer to beginning of list*/
stream=fopen("data.bin","r+b");
liststart = buildlist(); /*buildlist is a function which will*/
// clrscr(); /*return the beginning of the list*/
printf("Before insertion linked list:\n");
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
listinsert(part,liststart);
prntlist(liststart);
printf("Before deletion linked list:\n");
prntlist(liststart);
printf("Enter name to delete:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
listdelete(part,liststart);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,3);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,6);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,7);
prntlist(liststart);
/* printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,0);
prntlist(liststart);
*/
// does doesn't work but throws no error !!!!!!
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,22);
prntlist(liststart);
}//main
/*****************FUNCTION LISTINSERT**********************/
void listinsert(ENTRY newentry,LISTREC *liststart)
{
LISTREC *last,*next;
next = liststart;
while ((strcmp(newentry.name,next->info.name)> 0) && (next->link != NULL))
{
last = next;
next = next->link;
} /*end while*/
if (strcmp(newentry.name,next->info.name) == 0) /*if both are same*/
next->info = newentry; /*updates*/
else
if (strcmp(newentry.name,next->info.name) < 0)
{
last->link = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
last->link->info=newentry;
last->link->link = next;
}
else
{
next->link = (LISTREC*)malloc(sizeof(LISTREC));
next->link->info = newentry;
next->link->link = NULL;
} /* end else */
printf("\n\nAfter insertion, linked list:\n");
prntlist(liststart);
} /* end function listinsert*/
/**************FUNCTION BUILDLIST************************/
LISTREC *buildlist() /* Function buildlist returns type LISTREC.*/
{ /* It takes no arguments */
LISTREC *liststart = NULL;
/*of type LISTREC */
int n; /*Needed to test for end of file*/
//CREATE A DUMMY NODE !!!!
liststart=(LISTREC *)malloc(sizeof(LISTREC));
liststart->info.name[0]='\0';
liststart->link=NULL;
for (;;)
{ /*begin for*/ /*for will keep looping until breaks at end of file*/
n= fread(&part,sizeof(part),1,stream);
if (n==0) break;
listinsert(part,liststart);
} /*end for*/
return(liststart);
} /*end Function buildlist*/
/****************FUNCTION PRNTLIST********************/
void prntlist(LISTREC *liststart)
/*argument is a pointer to type LISTREC*/
{ /*begin function*/
while (liststart != NULL)
{ /*begin while*/
printf("%s\n",liststart->info.name);
liststart = liststart->link;
} /*end while*/
} /* end function prntlist*/
/*****************FUNCTION LISTDELETE**********************/
void listdelete(ENTRY part,LISTREC *liststart)
{
LISTREC *last,*next;
next = liststart;
while ((strcmp(part.name,next->info.name)!=0) && (next->link != NULL))
{
last = next;
next = next->link;
} /*end while*/
if (strcmp(part.name,next->info.name) == 0) /*if both are same*/
{
last->link=next->link; /*updates*/
free(next);
}
printf("\n\nAfter deletion, linked list:\n");
prntlist(liststart);
} /* end function listdelete*/
LISTREC * InsertAt(LISTREC *liststart, ENTRY newentry,int n)
{
int i = 0;
//LISTREC * liststart;
LISTREC * last = NULL;
LISTREC * next = liststart;
if (liststart == NULL)
{
liststart = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
liststart->info=newentry;
liststart->link = NULL;
printf("\n Created node at %d",i);
}//if
else while ((next->link != NULL) && (i != n))
{
last = next;
next = next->link;
++i;
}//else while
if (next == NULL)
{
next = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
next->info=newentry;
next->link = NULL;
printf("\n Created node at %d",i);
}//if
else if (i==n)
{
last->link = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
last->link->info=newentry;
last->link->link = next;
printf("\n Created node at %d",i);
}//else
return liststart;
}// insertAT
Solutions
Expert Solution
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct ENTRY
{
char name[81];
}ENTRY;
typedef struct LISTREC /* LISTREC is a user-defined type, defined */
{ /* before main so it will be global */
struct ENTRY info; /* info nests all fields contained in */
struct LISTREC *link; /* ENTRY (above). */
}LISTREC; /* link is a pointer variable to another */
/* type LISTREC. NOTE: Name of type MUST */
/* be entered at end of typedef */
FILE *stream;
ENTRY part;
//prototypes !!!!
void listdelete(ENTRY part,LISTREC *liststart);
LISTREC *buildlist();
void prntlist(LISTREC *);
void listinsert(ENTRY,LISTREC *);
LISTREC * InsertAt(LISTREC *, ENTRY ,int );
int main()
{
LISTREC *liststart; /*holds a pointer to beginning of list*/
stream=fopen("data.bin","r+b");
liststart = buildlist(); /*buildlist is a function which will*/
// clrscr(); /*return the beginning of the list*/
printf("Before insertion linked list:\n");
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
listinsert(part,liststart);
prntlist(liststart);
printf("Before deletion linked list:\n");
prntlist(liststart);
printf("Enter name to delete:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
listdelete(part,liststart);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,3);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,6);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,7);
prntlist(liststart);
//inserted the nodes three times at the beginning of list
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,0);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,0);
prntlist(liststart);
printf("Enter name to insert:");
scanf(" %[^\n]",part.name);
printf("part.name = %s\n",part.name);
liststart=InsertAt(liststart,part,0);
prntlist(liststart);
}//main
/*****************FUNCTION LISTINSERT**********************/
void listinsert(ENTRY newentry,LISTREC *liststart)
{
LISTREC *last,*next;
next = liststart;
while ((strcmp(newentry.name,next->info.name)> 0) && (next->link != NULL))
{
last = next;
next = next->link;
} /*end while*/
if (strcmp(newentry.name,next->info.name) == 0) /*if both are same*/
next->info = newentry; /*updates*/
else if (strcmp(newentry.name,next->info.name) < 0)
{
last->link = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
last->link->info=newentry;
last->link->link = next;
}
else
{
next->link = (LISTREC*)malloc(sizeof(LISTREC));
next->link->info = newentry;
next->link->link = NULL;
} /* end else */
printf("\n\nAfter insertion, linked list:\n");
prntlist(liststart);
} /* end function listinsert*/
/**************FUNCTION BUILDLIST************************/
LISTREC *buildlist() /* Function buildlist returns type LISTREC.*/
{ /* It takes no arguments */
LISTREC *liststart = NULL;
/*of type LISTREC */
int n; /*Needed to test for end of file*/
//CREATE A DUMMY NODE !!!!
liststart=(LISTREC *)malloc(sizeof(LISTREC));
liststart->info.name[0]='\0';
liststart->link=NULL;
for (;;)
{ /*begin for*/ /*for will keep looping until breaks at end of file*/
n= fread(&part,sizeof(part),1,stream);
if (n==0) break;
listinsert(part,liststart);
} /*end for*/
return(liststart);
} /*end Function buildlist*/
/****************FUNCTION PRNTLIST********************/
void prntlist(LISTREC *liststart)
/*argument is a pointer to type LISTREC*/
{ /*begin function*/
while (liststart != NULL)
{ /*begin while*/
printf("%s\n",liststart->info.name);
liststart = liststart->link;
} /*end while*/
} /* end function prntlist*/
/*****************FUNCTION LISTDELETE**********************/
void listdelete(ENTRY part,LISTREC *liststart)
{
LISTREC *last,*next;
next = liststart;
while ((strcmp(part.name,next->info.name)!=0) && (next->link != NULL))
{
last = next;
next = next->link;
} /*end while*/
if (strcmp(part.name,next->info.name) == 0) /*if both are same*/
{
last->link=next->link; /*updates*/
free(next);
}
printf("\n\nAfter deletion, linked list:\n");
prntlist(liststart);
} /* end function listdelete*/
LISTREC * InsertAt(LISTREC *liststart, ENTRY newentry,int n)
{
int i = 0;
//LISTREC * liststart;
LISTREC * last = NULL;
LISTREC * next = liststart;
if (liststart == NULL)
{
liststart = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
liststart->info=newentry;
liststart->link = NULL;
printf("\n Created node at %d",i);
}//if
else
while ((next->link != NULL) && (i != n))
{
last = next;
next = next->link;
++i;
}//else while
if(n==0)
{
next = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
next->info=newentry;
next->link =liststart;
liststart=next;
printf("\n Created node at %d",i);
}
else if (next == NULL)
{
next = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
next->info=newentry;
next->link = NULL;
printf("\n Created node at %d",i);
}//if
else if (i==n)
{
last->link = (LISTREC*)malloc(sizeof(LISTREC)); /*creates new node*/
last->link->info=newentry;
last->link->link = next;
printf("\n Created node at %d",i);
}//else
return liststart;
}// insertAt
I solved the problem adding node at 0 more than 2 times
Output
venereology answered 1 year agoRelated Solutions
I try to add the table content work, they will not allow me.. see below in...
Imagine that you are on the front line (also known as triage) in a hospital and...
If you were offered a position with a company which would allow you to take the...
As a professional financial consultant, you try to advise on the position of a diversified portfolio....
a) In front of spherical concave mirror of radius 26cm, you position an object of height...
Complete the following Customer class below. Also, add the equals method that would compare each field....
Generally Accepted Accounting Principles (GAAP) allow companies to choose any inventory costing method. GAAP also requires...
Elective abortion. Identify pros and cons that, when analyzed, will allow you form a defensible position...
Give me a problem you are interested in. Outline using Scientific method how you will try...
This format should allow you more time to think about your answer. You can also use...
- Hubble's constand and age of the universe question please show the working out for both parts
- You currently have $55,000 in your retirement account. You will make deposits of $11,000/year into your account...
- Using the Comparable Interface Write a class Compare3 that provides a static method largest. Method largest...
- Category Prior Year Current Year Accounts payable 3,173.00 5,942.00 Accounts receivable 6,838.00 9,022.00 Accruals 5,615.00 6,173.00...
- A. What is the Porsche's competitive strategy? In your answer, include two corporate policies that manifest...
- Represent -60 in binary using 8-bit signed magnitude. Add the following unsigned 8 bit binary numbers...
- Let A[1..n] be an array of distinct positive integers, and let t be a positive integer....