Project 1 - Creation of user defined data type to implement the user interfaces for working with ‘Set’ (Mathematical Set theory) using Linked List

FIRST PROJECT LINKED LIST

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int data;
struct Node* next;
};

void push(struct Node** head_ref, int new_data);
int isPresent(struct Node* head, int data);

struct Node* getUnion(struct Node* head1, struct Node* head2)
{
struct Node* result = NULL;
struct Node *h1 = head1, *h2 = head2;

while (h1 != NULL)
{
push(&result, h1->data);
h1 = h1->next;
}

while (h2 != NULL)
{
if (!isPresent(result, h2->data))
{
push(&result, h2->data);
}
h2 = h2->next;
}
return result;
}

struct Node* getIntersection(struct Node* head1, struct Node* head2)
{
struct Node* result = NULL;
struct Node* h1 = head1;

while (h1 != NULL)
{
if (isPresent(head2, h1->data))
{
push(&result, h1->data);
}
h1 = h1->next;
}
return result;
}

void push(struct Node** head_ref, int new_data)
{

struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));

new_node->data = new_data;

new_node->next = (*head_ref);

(*head_ref) = new_node;
}

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

int isPresent(struct Node* head, int data)
{
struct Node* h = head;
while (h != NULL)
{
if (h->data == data)
{
return 1;
}
h = h->next;
}
return 0;
}

int main()
{
int n,m,temp;
printf("enter the value of number of value in link list(both):-");
fflush(stdout);
scanf("%d %d", &n, &m);

struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;
//for loop for link list1
for(int i=0;i<n;i++)
{
printf("Enter the value in link list1 %d:-",i);
fflush(stdout);
scanf("%d", &temp);
push(&head1, temp);
}

for(int i=0;i<m;i++)
{
printf("Enter the value in link list2 %d:-",i);
fflush(stdout);
scanf("%d", &temp);
push(&head2, temp);

}

intersecn = getIntersection(head1, head2);

unin = getUnion(head1, head2);
printf("\n First list is ");

printList(head1);
printf("\n Second list is ");
printList(head2);
printf("\n Intersection list is ");
printList(intersecn);
printf("\n Union list is ");
printList(unin);
return 0;
}