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

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

//Linked list nodes
struct Node
{
int data;
struct Node* next;
};

// A function to insert a node in a linked list
void push(struct Node** head_ref, int new_data);
// A function to check if given data is present in the list

bool isPresent(struct Node* head, int data);

//A function to get union of two linked lists head1 and head2

struct Node* getUnion(struct Node* head1, struct Node* head2)
{
struct Node* result = NULL;
struct Node* t1 = head1, *t2 = head2;
//Insert all elements of list1 to the result list
while( t1 != NULL)
{
push(&result, t1->data);
t1 = t1->next;
}

//Insert those elements of list2 which are not present in the result list

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

//Function to get intersection of two linked lists

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

/*Traverse list1 and search each element in list2.if the element is first in list2, then insert element into result*/
while(t1 != NULL)
{
if(isPresent(head2, t1->data))
push(&result, t1->data);
t1 = t1->next;
}
return result;

}

//A function to insert a node at the beginning of linked list
void push(struct Node** head_ref, int new_data)
{
//allocate node
struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));
//put in the data
new_node->data = new_data;

//link the old list off the new node
new_node->next = (*head_ref);

//Move the head to point to the new node
(*head_ref) = new_node;
}

//A function to print a linked list
void printList(struct Node* node)
{
while(node != NULL)
{
printf("%d ", node->data);
node = node->next;
}
}

/*A function that returns true if data is present in linked list else return false*/
bool isPresent(struct Node* head, int data)
{
struct Node* t = head;
while(t != NULL)
{
if(t->data == data)
return 1;
t = t->next;
}
return 0;
}

int main()
{
//start with empty list
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersn= NULL;
struct Node* unin = NULL;

//create two linked list
push(&head1, 40);
push(&head1, 20);
push(&head1, 13);
push(&head1, 4);

push(&head2, 14);
push(&head2, 17);
push(&head2, 9);
push(&head2, 4);

intersn = getIntersection(head1, head2);
unin = getUnion(head1, head2);

printf("\n First Linked list :");
printList(head1);

printf("\n Second Linked list :");
printList(head2);

printf("\n Intersection list :");
printList(intersn);

printf("\n Union list :");
printList(unin);

return 0;
}