Answer Happy

C program: Add two
functions printForward() and printReverse() to Program
13.7 below that print elements of the linked list in
both of forward, and
reverse order at the same time
by using recursion.
(C language program only!!!),
Notice: The output have to be print out in
both forward and reverse order. not just print
single one of them. please write this whole complete program for
me, Im a new learner of C.
CODE:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXCHARS 30
#define DEBUG 0
/* here is the declaration of a linked list structure */
struct NameRec
{
char name[MAXCHARS];
struct NameRec *nextAddr;
};
/* here is the definition of the first structure pointer
*/
struct NameRec *firstRec;
int main()
{
void readInsert(); /* function prototypes */
void display();
firstRec = NULL; /* initialize list pointer */
readInsert();
display();
return 0;
}
/* get a name and insert it into the linked list */
void readInsert()
{
char name[MAXCHARS];
void insert(char *);
printf("\nEnter as many names as you wish, one per line");
printf("\nTo stop entering names, enter a single x\n");
while (1)
{
printf("Enter a name: ");
gets(name);
if (strcmp(name,"x") == 0)
break;
insert(name);
}
}
void insert(char *name)
{
struct NameRec *linearLocate(char *); /* function prototype
*/
struct NameRec *newaddr, *here; /* pointers to structure */
/* of type NameRec */
newaddr = (struct NameRec *) malloc(sizeof(struct NameRec));
if (newaddr == (struct NameRec *) NULL) /* check the address
*/
{
printf("\nCould not allocate the requested space\n");
exit(1);
}
/* locate where the new structure should be placed and */
/* update all pointer members */
if (firstRec == NULL) /* no list currently exists */
{
newaddr->nextAddr = NULL;
firstRec = newaddr;
}
else if (strcmp(name, firstRec->name) < 0) /* a new first
structure */
{
newaddr->nextAddr = firstRec;
firstRec = newaddr;
}
else /* structure is not the first structure of the list */
{
here = linearLocate(name);
newaddr->nextAddr = here->nextAddr;
here->nextAddr = newaddr;
}
strcpy(newaddr->name,name); /* store the name */
}
/* This function locates the address of where a new
structure
should be inserted within an existing list.
It receives the address of a name and returns the address of
a
structure of type NameRec
*/
struct NameRec *linearLocate(char *name)
{
struct NameRec *one, *two;
one = firstRec;
two = one->nextAddr;
if (two == NULL)
return(one); /* new structure goes after the existing single
structure */
while(1)
{
if(strcmp(name,two->name) < 0) /* if it is located within the
list */
break;
else if(two->nextAddr == NULL) /* it goes after the last
structure */
{
one = two;
break;
}
else /* more structures to search against */
{
one = two;
two = one->nextAddr;
}
} /* the break takes us here */
return(one);
}
/* display names from the linked list */
void display()
{
struct NameRec *contents;
contents = firstRec;
printf("\nThe names currently in the list, in alphabetical");
printf("\norder, are:\n");
while (contents != NULL) /* display till end of list */
{
printf("%s\n",contents->name);
contents = contents->nextAddr;
}
}