#include <stdio.

h>
#include <stdlib.h>
yarp
dasdsadasd
// Data Structure to store a linked list node
struct Node
{
int data;
struct Node* next;
};

// Helper function to print given linked list

void printList(struct Node* head)
{
struct Node* ptr = head;
while (ptr)
{
printf("%d -> ", ptr->data);
ptr = ptr->next;
}

printf("null");
}

// Helper function to insert new Node in the beginning of the linked list
void push(struct Node** head, int data)
{
// Allocate the new Node in the heap and set its data
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = data;

// Set the .next pointer of the new Node to point to the current
// first node of the list.
newNode->next = *head;

// Change the head pointer to point to the new Node, so it is

// now the first node in the list.
*head = newNode;
}

// Function that takes a linked list and returns a complete copy of that
// list using dummy node using push() function
struct Node* CopyList(struct Node* head)
{
struct Node* current = head; // used to iterate over original list
struct Node* newList = NULL; // head of the new list
struct Node* tail = NULL; // point to last node in new list

while (current != NULL)

{
// special case for the first new Node
if (newList == NULL)
{
push(&newList, current->data);
tail = newList;
}
else
{
push(&(tail->next), current->data); // add each node at tail
 tail = tail->next; // advance the tail to new last
node
}
current = current->next;
}

return newList;
}

// main method
int main(void)
{
// input keys
int keys[] = {1, 2, 3, 4};
int n = sizeof(keys)/sizeof(keys[0]);

// points to the head node of the linked list

struct Node* head = NULL;

// construct linked list

for (int i = n-1; i >= 0; i--)
push(&head, keys[i]);

// copy linked list

struct Node* dup = CopyList(head);

// print duplicate linked list

printList(dup);

return 0;
}