Question

In C++ syntax please

Write a program that implements and demonstrates a linked list using functions. Your program should first dehne a node that stores an integer and then your program will include the following functions appendo- This function accepts the head pointer (by reference) of a linked list and an integer as it's only arguments. It then creates a node, stores the integer argument in the node, and adds it to the end of the list. findo-This function accepts the head pointer (by value) of a linked list and an integer to search for in the list as it's only arguments. It then searches the list for the first occurrence of the integer argument. If it finds it, it returns true. If it doesn't, it returns false. clear) This function accepts the head pointer of a linked list (by reference) as it's only argument. It then removes all the nodes of the linked list from memory by deleting them one at a time. The . function leaves the head pointer set to nullptr print)- This function accepts the head pointer of a linked list (by value) as it's only argument and then displays on the screen all the integers stored in the list . remove0-accepts the head pointer of a linked list (by reference) and an integer as it's only arguments. The function then search for the integer argument in the list and removes the first node it finds containing the integer argument from the list. Demonstrate your functions by adding 5 numbers to the linked list. Then, print the list. Then search the list for a value and then indicate the result. Then, remove a number from the list. Then, print the list Then, clear the list. Then, print the list one last time The only functions that interact with the user is the print0 function (and main0). No other functions contain cin or cout statements. Notes: . Your solution will recelve major penalties for memory leaks . This assignment is a capstone assignment where you will demonstrate your accumulated knowledge over the semester A 20-Point Sample Run: 42 68 35 1 7e Found 68 in the 1ist 42 68 1 78 The first line contains all the integers of my list after appending them The second line is the result of my find function searching for 68. The third line is my list after I removed 35 using the remove function. Hints: Make sure you understand pointers and dynamic memory allocation Write your print) function first, it will help in testing. . Write one function at a time. . Use hand-tracing to hunt down any errors .if your program crashes, it is almost certainly because you are dereferencing an Invalid memory location which is the result of a logic error

Answer 1

//C++ program

#include<iostream>
using namespace std;
   struct node{
           int data;
           struct node*next;
       };

void append(struct node*&head,int data){
           struct node*newNode = new node;
           newNode->data = data;
           newNode->next=NULL;
          
           if(!head){
               head = newNode;
               return;
           }
           struct node*current = head;
          
           while(current->next)current=current->next;
           current->next = newNode;
       }
      
       bool find(struct node*head,int data){
           struct node*current = head;
           while(current){
               if(current->data==data)return true;
               current=current->next;
           }
           return false;
       }
       void clear(struct node*&head){
           struct node* current = head;
   struct node* next;
  
           while (current != NULL)
           {
       next = current->next;
       delete(current);
       current = next;
           }
           head = NULL;
       }
       void print(struct node*head){
           struct node*current = head;
           while(current){
               cout<<current->data<<" ";
               current=current->next;
           }
           cout<<"\n\n";
       }
       void remove(struct node*&head,int data){
           if(!find(head,data)){
               cout<<data<<" not in the linklist list\n";
               return ;
           }
           struct node*prev = head,*current=head;
           if(head->data==data){
               head=head->next;
               delete(current);
               return;
           }
           while(current&&current->data!=data){
               prev = current;
               current = current->next;
           }
           prev->next = current->next;
           delete(current);
       }

int main(){
   struct node*head=NULL;
   append(head,42);
   append(head,68);
   append(head,35);
   append(head,1);
   append(head,70);
  
   print(head);
  
   int num=68;
   if(find(head,num))cout<<"Found "<<num<<" int the list!\n";
   else cout<<"Not found "<<num<<" int the list!\n";
  
   remove(head,35);
   print(head);
   return 0;
}

//sample output

CAUsers\IshuManish\ Documents appendlist.exe 2 68 35 1 7D ound 68 int the list! 42 68 1 70 Process exited after 0.1952 seconds with return value a ress any key to continue . . .