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

/*
* C1_Proj_01.c
*
* Created on: 25-May-2023
* Author: Omkar B
*/

// Mathematical Set Theory using Linked Lists

#include
#include
#include

// Link list node
struct Node
{
int data;
struct Node* next;
};

/* A utility function to insert a
node at the beginning ofa linked list*/
void push(struct Node** head_ref, int new_data);

/* A utility function to check if
given data is present in a list */
bool isPresent(struct Node* head,int data);

/* 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 *id1 = head1, *id2 = head2;

// Insert all elements of
// list1 to the result list
while (id1 != NULL)
{
push(&result, id1->data);
id1 = id1->next;
}

// Insert those elements of list2
// which are not present in result list
while (id2 != NULL)
{
if (!isPresent(result, id2->data))
push(&result, id2->data);
id2 = id2->next;
}

return result;
}

/* Function to get intersection of
two linked lists head1 and head2 */
struct Node* getIntersection(struct Node* head1,struct Node* head2)
{
struct Node* result = NULL;
struct Node* id1 = head1;

// Traverse list1 and search each element
// of it in list2. If the element is
// present in list 2, then insert the
// element to result
while (id1 != NULL)
{
if (isPresent(head2, id1->data))
push(&result, id1->data);
id1 = id1->next;
}

return result;
}

/* A utility function to insert a
node at the beginning of a 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 utility function to print a
linked list*/
void printList(struct Node* node)
{
while (node != NULL)
{
printf("%d ", node->data);
node = node->next;
}
}

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

// Driver code
int main()
{
// Start with the empty list
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersection = NULL;
struct Node* unin = NULL;

/* Create a linked list 1*/

for(int i=0; i<4; i++)
{
int dt_n;
printf("Enter Data for the node %d of First Linked List: \t", (i+1));
fflush(stdout);
scanf("%d",&dt_n);
push(&head1, dt_n);
}
printf("\n");

/* Create a linked list 2*/
for(int i=0; i<4; i++)
{
int dt_n;
printf("Enter Data for the node %d of Second Linked List: \t", (i+1));
fflush(stdout);
scanf("%d",&dt_n);
push(&head2, dt_n);
}

intersection = 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(intersection);

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

return 0;
}