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

PROJECT 1

#include <stdbool.h> //pre processor section
#include <stdio.h>
#include <stdlib.h>
/* Link list node */
struct Node

{
int data;
struct Node* next;
};

void push(struct Node** head_ref, int new_data);

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

/* Function to get union of 2 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 all elements of list 1 to the result list//
while (t1 != NULL)

{
push(&result, t1->data);
t1 = t1->next;
}


while (t2 != NULL)

{
if (!isPresent(result, t2->data))
push(&result, t2->data);
t2 = t2->next;
}

return result;
}

/* Function for intersection of 2 linked lists head 1 & head 2*/
struct Node* getIntersection(struct Node* head1,

struct Node* head2)

{
struct Node* result = NULL;
struct Node* t1 = head1;


while (t1 != NULL)

{
if (isPresent(head2, t1->data))
push(&result, t1->data);
t1 = t1->next;
}

return result;
}

/* A 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));


new_node->data = new_data;


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

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

/*Main function*/
int main()
{
/* Start with the empty list */
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;

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

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

intersecn = getIntersection(head1, head2);
unin = getUnion(head1, head2);

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

printf("\n Second list is \n");
printList(head2);

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

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

return 0;
}