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

// Giving two list of data as input
//to get the output as union & intersection for given list of data.
#include
#include
#include
/* Link 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** h_ref, int new_data);

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

// Function to get union of two linked lists h1 and h2
struct Node* getUnion(struct Node* h1,struct Node* h2)
{
struct Node* result = NULL;
struct Node *t1 = h1, *t2 = h2;

// 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 h1 and h2
struct Node* getIntersection(struct Node* h1,struct Node* h2)
{
struct Node* result = NULL;
struct Node* t1 = h1;

// 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(h2, t1->data))
push(&result, t1->data);
t1 = t1->next;
}

return result;
}

//A utility function to insert a node at the beginning of a linked list.
void push(struct Node** h_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 = (*h_ref);

// move the h to point to the new node
(*h_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* h, int data)
{
struct Node* t = h;
while (t != NULL) {
if (t->data == data)
return 1;
t = t->next;
}
return 0;
}

//The Driver program to test above function.
int main()
{
// Starting with the empty list
struct Node* h1 = NULL;
struct Node* h2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;

//create a linked lists 10->15->5->20
push(&h1, 18);
push(&h1, 9);
push(&h1, 3);
push(&h1, 20);

/*create a linked lists 8->4->2->10 */
push(&h2, 10);
push(&h2, 18);
push(&h2, 4);
push(&h2, 3);

intersecn = getIntersection(h1, h2);
unin = getUnion(h1, h2);

printf("\n The First list is \n");
printList(h1);

printf("\n The Second list is \n");
printList(h2);

printf("\n The Intersection list is \n");
printList(intersecn);

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

return 0;
}