Question

above in the image is a linked list with 2 nodes. You can use this or write a similar one. The assignment is to write 2 functions. One function will add another node at the end of the list. The other function will delete a node. Don't forget - No dangling pointers

#include iostream» using namespace std; class Node int data; Node *next; public void setdata(int d) data d;) void setnext (Node p)next P; int getdata() Treturn data;) Node getnext() freturn *next;) d: int main() Node *N1 = new Node; N1->setdata (1000); Node "N2 = new Node; N2->setdata (2000); N1->setnext( N2) ; N2->setnext (NULL); system("pause"; return 6;

C++ language

Make sure its corect and runs without errors and I promise to give you a thumbs up.

Answer 1

#include <iostream>

using namespace std;

class Node {

    int data;
    Node* next;

public:
    void setdata(int d) { data = d; }
    void setnext(Node* p) { next = p; }
    int getdata() { return data; }
    Node *getnext() { return next; }
};

void add(Node **head, int data) {
   Node *n = new Node;
   n->setdata(data);
   n->setnext(NULL);
   if(*head == NULL) {
       *head = n;
   } else {
       Node *temp = *head;
       while(temp->getnext() != NULL) {
           temp = temp->getnext();
       }
       temp->setnext(n);
   }
}

void remove(Node **head, int data) {
   if(*head != NULL) {
       if((*head)->getdata() == data) {
           *head = (*head)->getnext();
       } else {
           Node *temp = *head;
           while(temp->getnext() != NULL) {
               if(temp->getnext()->getdata() == data) {
                   Node *d = temp->getnext();
                   temp->setnext(temp->getnext()->getnext());
                   delete d;
                   break;
               }
               temp = temp->getnext();
           }
       }
   }
}

void print(Node *head) {
   Node *temp = head;
   while(temp != NULL) {
       cout << temp->getdata() << " -> ";
       temp = temp->getnext();
   }
   cout << endl;
}

int main()
{

    Node *head = NULL;
    add(&head, 5);
    add(&head, 3);
    add(&head, 1);
    add(&head, 7);
    add(&head, 6);
    cout << "Initial linked list: ";
    print(head);
    remove(&head, 5);
    remove(&head, 7);
    cout << "Linked list after removing 5 and 7: ";
    print(head);
    return 0;
}

Initial linked 1list: 5- 3 -> 1 -> 7-> 6 -> Linked list after removing 5 and ?: 3 -1- 6 -> Process exited after 0.1193 seconds with returnvalue 0 Press any key to continue - - -