#include <stdio.h>
#include <stdlib.h> 
struct node {
    int val;
    struct node *next;
};
typedef struct node NODE;


int main() {
    int arr1[] = {12, 43, 56, 34, 98};
    int arr2[] = {85, 97, 100};
    int size1 = sizeof(arr1) / sizeof(arr1[0]);
    int size2 = sizeof(arr2) / sizeof(arr2[0]);
    
    NODE* current,*previous,*head;
    
    for (int i = 0;i < size1;i++){
    	current = (NODE*)malloc(sizeof(NODE));
    	current->val = arr1[i];
    	if (i != 0){
    		previous->next = current;
    	}
    	else{
    		head = current;
    	}
    	current->next = NULL;
    	previous = current;
    }
    while(head != NULL){
    	printf("%d ",head->val);
    	head = head->next;
    }
    
}