Complete the problem below using valid C syntax. 6. (15 points) Suppose you desi

Question

Complete the problem below using valid C syntax.

6. (15 points) Suppose you design a linked list so that it doesn't have a ta Instead, the list is circular, and the "tail" in this case doesn't have a NULL pointer. Instead, it points back to the head. Here's a drawing to show you what such a list would look like. tail: head data: 10 data: 15 data: 11 data: 20 next: next: next: next: struct list int data; struct list next (a) (8 points) Using the struct declaration shown above, implement a function that inserts a node into the list. You may insert the node anywhere you wish, but the circular list of connections must be preserved. You must use the following prototype, which assumes the head of the list is passed as an argument, the data to insert is passed as an argument, and the return value is the new head of the list. struct list insert (struct list 'head, int data)

Explanation / Answer

struct list * insert(struct list *head, int data){

    // creating new node

    struct list *newNode = (struct list *)malloc(sizeof(struct list));

    newNode->data = data;
    newNode->next = NULL;

    if(head == NULL){
        head = newNode;
        head->next = head;
        return head;
    }

    // inserting new node after head
    newNode->next = head->next;
    head->next = newNode;

    return head;
}

struct list *find(struct list *head, int data){

    if(head == NULL)
        return NULL;

    if(head->data == data){
        return head;
    }

    struct list *temp = head->next;
    while(temp != head){
        if(temp->data == data)
            return temp;
        temp = temp->next;
    }
}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.