Question

Write a function that adds the values of the nodes at the beginning and end of a circular linked list and adds the result as the last element of the list. You can assume that there are at least two elements in the list.

Answer 1

//C code

#include<stdio.h>
#include<stdlib.h>

typedef struct node{
   int data;
   struct node*next;
}Node;

void add(Node*head){
   Node* current = head->next;
  
   while(current->next != head) current = current->next;
  
   int result = current->data + head->data;
  
   Node* newNode = (Node*) malloc(sizeof(Node));
   newNode->data = result;
   newNode->next = current->next;
   current->next = newNode;
}