Question

All the functions are written and work besides removeLinkedList and contains LinkedList. Please fill those out.

무#ifndef #define LINKEDLIST-H LINKEDLISTH define TYPE /*# define TYPE SIZE sizeof (TYPE) */ double typedef struct ListStack LinkedList; void initLinkedLǐst(LinkedList *1); void freeLinkedList (LinkedList *1) int İsEmptyLinkedList (LinkedList*1); void pushLinkedList (LinkedList #1, TYPE val); TYPE topLinkedList (LinkedList 1) void popLinkedList (LinkedList *1); /* Bag / void addLinkedList (LinkedList *1, TYPE val) ; int containsLinkedList (LinkedList *1, TYPE val) ; void removeLinkedList (LinkedList l, TYPE val) L#endif # include param: 1 the linked List pre: 1 is not null post: the head of the linked list is initialised to null, isEmpty returns true void initLinkedList (LinkedList 1) 1-> head = MULL; param: 1 the linked list pre: 1 is not null 《1-head HULL) ; teturn param: 1 the linked list pre: 1 is not null post: siseLinkedList returns true /1 Note: Free gets rid of 11 links but keep5 the head of the list around, so the list itself still exist5 and 15 initi lined. while 《'isEmptyLinkedList(1)) popLinkedList(l): Stac Interface param: 1 the linked list param: val the value to be pushed pre: 1 is not null post: 1 is not empty, 1 sie has increased by one void pushLinkedList (LinkedList *1, TY?E val) I struct Link *lin(struct Link *)malloc (sizeof (struct Lint)) 교5sert(Link !=NULL); / Stack Interface/ pushLinkedList param: 1 the linked list param: val the value to be pushed pre: l is not nul] post: 1 is not empty, l size has increased by one void pushLinkedList (LinkedList l, TYPE val) i struct Link *link (struct assert (link != NULL); Link *)malloc (sizeof (struct Link)); link->next -1->head; link->val -val 1->head1ink topLinkedList params: 1 the linked list pre: l is not null pre: 1 is not empty post: none TYPE topLinkedList (LinkedList *l) assert (isEmptyLinkedList (1)) return l->head->val popLinkedList param: 1 the linked list pre: l is not nul] pre: 1 is not empty post: 1 size has decremented by one void popLinkedList (LinkedList struct Link link-1->head; void popLinkedList (LinkedList *l) struct Link *link l->head ; assert (!isEmptyLinkedList (l)) 1-)head link->next ; free (link) Bag */ void addLinkedList (LinkedList *l, TYPE val) pushLinkedlist (l,val) int containsLinkedList (LinkedList *l, TYPE val) /*write this function * void _removeLink (struct Link *prev, struct Link *cur) prev->nextcur-next: free (cur) void removeLinkedList (LinkedList *l, TYPE val) struct Link *cur: struct Link *prev: assert (containsLinkedList (l, val)) /special case for head/ if (1->head-alval) cur 1-head 1-2head 1->head->next ; free (cur) else /* write this part of the function

Answer 1

// function to check if val is in linked list l
int containsLinkedList(LinkedList *l, TYPE val)
{
   if(!isEmptyLinkedList(l)) // if list is empty
   {
       struct Link *list = l->head; // let list point to head of linkedlist
       while(list != NULL) // loop over the list
       {
           if(list->val == val) //check if val is found
               return 1; // return true
           list = list->next;   // set list to next node
       }
  
   }

   return 0; //val not found
}

//end of containsLinkedList

// function to remove a value from linked list

void removeLinkedList(LinkedList *l, TYPE val)
{
   struct Link *curr ;
   struct Link *prev;
  
   assert(containsLinkedList(l),val);
  
   /*special case for head*/
   if(l->head->val == val)
   {
       curr = l->head;
       l->head = l->head->next;
       free(curr);
   }else
   {
       curr = l->head->next; // set curr to node next to head
       prev = l->head; // set prev to head
      
       // loop over the linked list
       while(curr != NULL)
       {
           if(curr->val == val) // if val is found
           {
               prev->next = curr->next; // set the next pointer to prev to point to node next to curr
               free(curr); // delete curr
               break; // break out of loop
           }
          
           prev = curr; // set prev to curr
           curr = curr->next; // set curr to node next to curr
       }
   }
}

//end of removeLinkedList