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

Linked list using mathematical set theory

#include <stdbool.h> //Standard library for boolean
#include <stdio.h> //Standard input/output library
#include <stdlib.h> //standard library for malloc()

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

// A utility function to insert a node at the beginning of a 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* list1, struct Node* list2)
{
struct Node* result = NULL;
struct Node *l1 = list1, *l2 = list2;

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

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

return result;
}

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

// 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 (l1 != NULL) {
if (isPresent(list2, l1->data))
{
push(&result, l1->data);
}
l1 = l1->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 of 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* t = head;
while (t != NULL) {
if (t->data == data)
{
return 1;
}
t = t->next;
}
return 0;
}

// Driver program to test above function
int main()
{
// Start with the empty list
struct Node* list1 = NULL;
struct Node* list2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;

//create a linked lists 10->15->5->20
push(&list1, 20);
push(&list1, 5);
push(&list1, 15);
push(&list1, 10);

//create a linked lists 8->4->2->10
push(&list2, 10);
push(&list2, 2);
push(&list2, 4);
push(&list2, 8);

intersecn = getIntersection(list1, list2);
unin = getUnion(list1, list2);

printf("First list is \n");
printList(list1);

printf("\nSecond list is \n");
printList(list2);

printf("\nIntersection list is \n");
printList(intersecn);

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

return 0;
}