Question

Assume you have a linked list of integer data pointed by head (p-head). head e2 next nextー next next Qu: Write the recursive method that duplicates (make a separate copy) the linked list (2 Points) Q2: Write the method that sort the linked list in increasing order (from smallest to the largest) (2 Points) Q3: Write the method that returns true if all the elements of the linked list are different. It return false otherwise (1 Point)

Answer 1

struct node

{

int data;

struct node* next;

};

struct node* duplicate(struct node* p)

{

struct node* current=p;

if(current==NULL)   

return NULL;

else

{

struct node* List=(struct node*)malloc(sizeof(struct node)); //allocating memory for new node

List->data=current->data; // copying data into that node

List->next=duplicate(current->next); // recursion takes place here

return(List);

}

}

void bubbleSort(struct Node * p)

{

    int swapped, i;

    struct node *ptr1;

    struct node *lptr = NULL;

    if (p == NULL)

        return;

    do

    {

        swapped = 0;

        ptr1 = p;

  

        while (ptr1->next != lptr)

        {

            if (ptr1->data > ptr1->next->data)

            {

                swap(ptr1, ptr1->next); // swap the data values if ptr1->data is greater than ptr1->next->data   

                swapped = 1;

            }

            ptr1 = ptr1->next;

        }

        lptr = ptr1;

    }

    while (swapped);

}

/* function to swap data of two nodes a and b*/

void swap(struct Node *a, struct Node *b)

{

    int temp = a->data;

    a->data = b->data;

    b->data = temp;

}

To implement this function initially include stdbool.h ilibrary.

bool different(struct node* p)
{

struct node* current;
struct node* temp=p;
   while(temp!=NULL)
   {
       current=temp->next;
       while(current!=NULL)
       {
           if(temp->data==current->data ) //checking for the same element.
           {
               return false; //if matches return false
           }
           else // if not matches move the current pointer forward
           {
               current=current->next;
}
       }
       temp=temp->next; // move the temp pointer forward
   }
   return true;
}