Project 1 - Creation of user defined data type to implement the user interfaces for working with ‘Set’ (Mathematical Set theory) using Linked List
#offline embedded batch
/* fist 3 line header file*/
#include
#include
#include
/* create structure for node*/
struct node
{
int data;//data member
struct node* next;//data member
};
// function to insert a node at the beginning of a linked list
void push(struct node* *head_ref, int new_data);
//function that returns true if data is present in linked list else return false
bool isPresent(struct node *head, int data);
//to get union of two linked lists head1 and head2
struct node *Union(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;
}
// to get intersection of two linked lists head1 and head2
struct node *Intersection(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;
}
void push (struct node** headref, int newdata)
{
struct node* newnode =(struct node*) malloc(sizeof(struct node));//allocate node
newnode->data = newdata;// put in the data
newnode->next = (*headref);//link the old list off the new node
(*headref) = newnode;//move the head to point to the new node
}
void printList (struct node *node)//function to print a linked list
{
while (node != NULL)
{
printf ("%d ", node->data);
node = node->next;
}
}
bool isPresent (struct node *head, int data)//function that returns true if data is
// present in linked list else return false
{
struct node *t = head;
while (t != NULL)
{
if (t->data == data)
return 1;
t = t->next;
}
return 0;
}
int main()
{
/* Start with the empty list */
struct node* head1 = NULL;
struct node* head2 = NULL;
struct node* intersectionvalue = NULL;
struct node* unionvalue = NULL;
/*create a linked lits for A */
push (&head1, 5);
push (&head1, 6);
push (&head1, 10);
push (&head1, 11);
/*create a linked lits for B */
push (&head2, 11);
push (&head2, 8);
push (&head2, 6);
push (&head2, 2);
intersectionvalue= Intersection (head1, head2);
unionvalue= Union (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 (intersectionvalue);
printf ("\n Union list is \n");
printList ( unionvalue);
return 0;
}