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

                                                              ONLINE BATCH STUDENT

CODE:

/*
* project.c
*
* Created on: 09-Aug-2022
* Author: Ashish Kamthe
*/

//header files
#include
#include
#include

//node is created
struct Node
{
int data;
struct Node *next;
};

//function declaration
void push(struct Node **head_ref, int new_data);
int 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 *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 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 head1 and head2
struct Node *getIntersection(struct Node* head1, struct Node* head2)
{
struct Node *result = NULL;
struct Node *t1 = 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 (t1 != NULL)
{
if (isPresent(head2, t1->data))
{
push(&result, t1->data);
}
t1 = t1->next;
}
return result;
}

// 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;
}

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

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

// main program to test above function
int main()
{
int n,m,temp;
printf("Enter number of nodes in first Linked List:");
fflush(stdout);
scanf("%d", &n);
printf("Enter number of nodes in second Linked List:");
fflush(stdout);
scanf("%d", &m);
// Start structure pointer with the empty list
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;

//for loop for link list1
for(int i=1;i<=n;i++)
{
printf("Input data for node %d of link list1:",i);
fflush(stdout);
scanf("%d", &temp);
push(&head1, temp);
}

//for loop for link list2
for(int i=1;i<=m;i++)
{
printf("Input data for node %d of link list2:",i);
fflush(stdout);
scanf("%d", &temp);
push(&head2, temp);
}

//call the function of intersection
intersecn = getIntersection(head1, head2);

//call the function of union
unin = getUnion(head1, head2);

printf("\n Linked list 1: ");
//function calling with structure pointer as argument
printList(head1);
printf("\n Linked list 2: ");
printList(head2);
printf("\n Intersection elements are: ");
printList(intersecn);
printf("\n Union of LL1 & LL2 is: ");
printList(unin);
return 0;
}

Output:

Enter number of nodes in first Linked List:5
Enter number of nodes in second Linked List:5
Input data for node 1 of link list1:1
Input data for node 2 of link list1:2
Input data for node 3 of link list1:3
Input data for node 4 of link list1:4
Input data for node 5 of link list1:5
Input data for node 1 of link list2:6
Input data for node 2 of link list2:7
Input data for node 3 of link list2:8
Input data for node 4 of link list2:9
Input data for node 5 of link list2:3

Linked list 1: 5 4 3 2 1
Linked list 2: 3 9 8 7 6
Intersection elements are: 3
Union of LL1 & LL2 is: 6 7 8 9 1 2 3 4 5