Project 1 - Creation of user defined data type to implement the user interfaces for working with ‘Set’ (Mathematical Set theory)
// C program to find union and intersection of two unsorted linked lists:
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
/* Link list node */
struct Node {
int data;
struct Node* next;
};
/* The function to insert the data into the List */
void push(struct Node** head_ref, int new_data);
/* The function to check the given data is present in a Linked List */
bool isPresent(struct Node* head, int data);
/* Function to get union of two linked lists head 1 and head 2 */
struct Node* getUnion(
struct Node* head1,
struct Node* head2)
{
struct Node* result = NULL;
struct Node *t1 = head1, *t2 = head2;
//Insert the elements of List 1
while (t1 != NULL) {
push(&result, t1->data);
t1 = t1->next;
}
// Insert those elements of List 2
while (t2 != NULL) {
if (!isPresent(result, t2->data))
push(&result, t2->data);
t2 = t2->next;
}
return result;
}
/* Intersection of two linked lists head 1 and head 2 */
struct Node* getIntersection(struct Node* head1,
struct Node* head2)
{
struct Node* result = NULL;
struct Node* t1 = head1;
//Traverse list 1 and search each element of it in list 2. 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;
}
/* The function to insert the data into the 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;
}
}
/* The function to check the given data is present in a Linked List */
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()
{
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;
/*create a linked lists */
push(&head1, 10);
push(&head1, 22);
push(&head1, 44);
push(&head1, 34);
/*create a linked lists */
push(&head2, 44);
push(&head2, 66);
push(&head2, 10);
push(&head2, 77);
intersecn = getIntersection(head1, head2);
unin = getUnion(head1, head2);
printf("First list: \n");
printList(head1);
printf("\nSecond list: \n");
printList(head2);
printf("\nIntersection list: \n");
printList(intersecn);
printf("\nUnion list: \n");
printList(unin);
return 0;
}