Question

Implement the following new functions for manipulating the list: a. InsertAfter?node* node_ptr, value) - inserts a new node following the node pointed to by node_ptr. The new node will have value inserted as its data. The type for value will be consistent with your previous 2-way list lab. b. DeleteNode(node* node_ptr) – removes the node pointed to by node_ptr from the list. BE SURE TO FREE THE NODE!!! Be careful if the anchor is the 1* node!! Do not delete that one if it is not dynamic! FindValue(value) - locates the first occurrence of value in the list and returns a pointer to that node and sets a global integer that tells which node number it is. Do NOT count the anchor as a node unless your design has the anchor containing data like any other node. Use this as input to DeleteNode. d. You may implement an "isEmpty" function if it simplifies your program. e. You may need to add code to, or modify, your original Push code. Using the above functions, modify your main program as follows: a. Read a sequence of at least 10 characters and remember the 3rd character (not including linend or space characters) in the list for later. b. Push the characters into the list (1 character per node) – DUPLICATES ARE KEPT. DO NOT allow linend or space characters to be in the list, because they do not print. c. Do the following after the last symbol is reached: i. print the list in forward order ii. search the list for the remembered character and do these actions: 1. display the position # of that character in the list 2. insert the symbol, "*", after the remembered character 3. delete that remembered character from the list 4. print the list in forward order again, so we can see it was deleted 5. delete all remaining copies of the remembered character (if any). 6. print the list in forward order again

Modify the below code to fit the above requirements:

struct node

{

char data;

struct node *next;

struct node *previous;

} *front, *MyNode, *rear, *MyPointer, *anchor *Valuenode ;

typedef struct node node;

int Push(char input)

{

if(IsFull()==1)

{  

printf("The queue is full. Enter the ‘^’ character to stop.\n");

return -1;

}

else if (IsFull()==-1)

{

node *MyNode=(node*)malloc(sizeof(node));

MyNode->data=input;

rear->next=MyNode;

MyNode->previous=rear;

MyPointer=rear=MyNode;

return 1;

}

else

{

node *MyNode=(node*)malloc(sizeof(node));

node *anchor=(node*)malloc(sizeof(node));

MyNode->data=input;

MyPointer=rear=front=MyNode;

MyNode->previous=NULL;

MyNode->next=NULL;

anchor->next=MyNode;

return 0;

}

}

char Pull()

{

char output = 0 ;

char pnull = 0;

if (IsFull()==0)

{  

return pnull;

}

else

{   

output= front->data;

front=front->next;

}

return output;

}

char Pullback()

{

char output = 0 ;

char pullbacknull = 0;

if (IsFull()==0)

{  

return pullbacknull;

}

else

{   

output= front->data;

rear=rear->next;

}

return output;

}

char Front()

{

char fnull = 0 ;

if (IsFull()==0)

{  

return fnull;

}

else

{   

return front->data;

}

}

char Back()

{

char rnull = 0 ;

if (IsFull()==0)

{  

return rnull;

}

else

{   

return rear->data;

}

}

int IsFull()

{

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

if (front == NULL)

{

return 0;

}

else if (temp==NULL)

{

return 1;

}

  

else

{

return -1;  

}   

}

int Getnext(int choice)

{

if (choice==1)

{

if (MyPointer->previous==NULL)

{

return 0;

}

else

MyPointer=MyPointer->previous;

}

else

{

if (MyPointer->next==NULL)

{

return 0;

}

else

MyPointer=MyPointer->next;

}

return 1;

}

struct node * GetCurrent()

{

return MyPointer;

}

void Reset(int choice2)

{

if (choice2 ==0)

{

MyPointer->next=rear;

}

else

{

MyPointer->next=front;

}

}   

int Delete()

{

if (MyPointer!=NULL)

{

free(MyPointer);

return 1;

}

else   

{   

return 0;

}

}

// New Functions

void InsertAfter(node* MyPointer, char data)

{

Valuenode->previous=MyPointer;

Valuenode->data=data;

}

void DeleteNode(node* MyPointer)

{

if MyPointer->next!=anchor

{free(Valuenode)}

}

void FindValue(char value)

{

  

}

int main() //Queue does end up the IsFull function unlike the Top function in a stack

{

front=(node*)malloc(sizeof(node));

rear=(node*)malloc(sizeof(node));

Valuenode=(node*)malloc(sizeof(node));

MyPointer=(node*)malloc(sizeof(node));

front=NULL;

rear=NULL;

valuenode=NULL;

MyPointer=NULL;

printf("Please input character string:");

while ((input=fgetc(stdin))!='^')

{

if (isalpha(input)||isdigit(input))

Push(input);

}

Print(); //Calls print function

printf("Is pointer deleted? %d\n",Delete());

  

return 0;

};

Answer 1

Trnferenting the first tue functitno: Srnuorure ケt.run/足 ー1//Lnanrint after a gium Tura hudud ะ nrUL.phr-nentti