//Project 1 - Creation of user defined data type to implement the user interfaces for working with ‘Set’ (Mathematical Set theory) using Linked List
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
//step1: create a node.
typedef struct node//defining the structure
{
int data;//creating the data type of the variable
struct node *next;//creating self referential node
}
Node;//changing the structure name as node
static Node *head1,*head2, *head_union,*head_intersection,*newnode,*tail,*res_union,*res_intersection;//declaring
/* Declaring different function with the arguments*/
Node *insert_node(Node *head_ref,int n);
void display_list(Node *head_ref);
Node *get_union(Node *head_pointer1,Node *head_pointer2);
Node *get_intersection(Node *head_pointer1,Node *head_pointer2);
int compare(Node *head,int data);
void display_list(Node *head_ref) //function used to display the nodes data.
{
if(head_ref == 0)
{
printf("List is empty.");
}
else
{
tail = head_ref;//we are transfering address if the list to tail
while(tail != 0)
{
printf("%d",tail->data); //print the data of the current node
tail = tail->next; //advances the position of current node...accessing the structure pointers..
}
tail = newnode;
}
}
Node *insert_node(Node *head_ref,int n) //function used create the new list
{
printf("\nIntersecting Elements at the beginning...\n");
newnode =(Node*)malloc(sizeof(Node)); //allocating the memory to the nodes
printf("Address of created newnode :%d\n",newnode);
newnode->data = n;//assigning the value to node
printf("Inserted value is :%d\n",newnode->data);
newnode->next = head_ref;//address of the previous address is transferred to the new node
head_ref = newnode; //transferring the new address to the head ref for linking new node
return head_ref;
}
Node *get_union(Node *head_pointer1,Node *head_pointer2)//function used to union to list
{
while(head_pointer1 != 0)//2 3 4 5
{
head_union = insert_node(head_union,head_pointer1->data);//here we are inserting the data of List 1 into the union function
head_pointer1 = head_pointer1->next;//we transverse the node using the address in next.
}
while(head_pointer2 != 0) //3 4 5 6
{
if(!compare(head_union,head_pointer2->data))//here we are inserting the element from list 2 number where not in the
head_union = insert_node(head_union,head_pointer2 ->data);//inserting the element not in the list2
head_pointer2 = head_pointer2->next; //travelling to next node
}
return head_union; //2 3 4 5 6
}
int compare(Node *head,int data)
{
while (head != NULL)
{ //2
if (head->data == data) //comparing the data of List 2 with List1
return 1;
head = head ->next;
}
return 0;
}
Node *get_intersection(Node *head_pointer1,Node *head_pointer2)
{
while (head_pointer1 !=0)
{
if (compare(head_pointer2, head_pointer1->data))//we are comparing the both list of intersection
head_intersection = insert_node(head_intersection,head_pointer1->data);//transferring the that value to the intersection
head_pointer1 = head_pointer1 ->next;
}
return head_intersection;
}
int main()
{
int first_list_nodes = 0,second_list_nodes = 0,first_list_items = 0,
second_list_items = 0;
int f;
printf("Enter the number of Nodes in first list:");
fflush(stdout);
scanf("%d",&first_list_nodes); //4( 2 3 4 5)
printf("Enter %d the elements:", first_list_nodes);//getting the number of element in the lists
for( f = 0;f < first_list_nodes;f++)
{
fflush(stdout);
scanf("%d",&first_list_items); //getting the data in run time
head1 = insert_node(head1,first_list_items);//inserting the data in the list
}
display_list(head1); //displating the head1 list
printf("\nEnter the number of Nodes in second List:");
fflush(stdout);
scanf("%d",&second_list_nodes);
printf("Enter %d the elements:", second_list_nodes);
for(f = 0;f < second_list_nodes;f++)
{
fflush(stdout);
scanf("%d",& second_list_items);//getting the data in run time
head2 = insert_node(head2,second_list_items);//inserting the data in the list
}
display_list(head2); //displating the head2 list
res_union = get_union(head1,head2);//transferring the result of union function to the res union
printf ("Here is the result of union: ");
display_list(res_union); //transferring the values as arguments to display function
res_intersection = get_intersection(head1,head2);//transferring the result of intersection function to the res intersection
printf ("Here is the result of intersection: ");
display_list(res_intersection); //transferring the values as arguments to display function
}
Enter the number of Nodes in first list:4
Enter 4 the elements:1 2 3 4
Intersecting Elements at the beginning...
Address of created newnode :11607096
Inserted value is :1
Intersecting Elements at the beginning...
Address of created newnode :11607112
Inserted value is :2
Intersecting Elements at the beginning...
Address of created newnode :11607128
Inserted value is :3
Intersecting Elements at the beginning...
Address of created newnode :11607144
Inserted value is :4
4321
Enter the number of Nodes in second List:5
Enter 5 the elements:5 6 7 8 9 10 11
Intersecting Elements at the beginning...
Address of created newnode :11607160
Inserted value is :5
Intersecting Elements at the beginning...
Address of created newnode :11607248
Inserted value is :6
Intersecting Elements at the beginning...
Address of created newnode :11607264
Inserted value is :7
Intersecting Elements at the beginning...
Address of created newnode :11607280
Inserted value is :8
Intersecting Elements at the beginning...
Address of created newnode :11607296
Inserted value is :9
98765
Intersecting Elements at the beginning...
Address of created newnode :11607312
Inserted value is :4
Intersecting Elements at the beginning...
Address of created newnode :11607328
Inserted value is :3
Intersecting Elements at the beginning...
Address of created newnode :11605624
Inserted value is :2
Intersecting Elements at the beginning...
Address of created newnode :11605640
Inserted value is :1
Intersecting Elements at the beginning...
Address of created newnode :11605656
Inserted value is :9
Intersecting Elements at the beginning...
Address of created newnode :11605672
Inserted value is :8
Intersecting Elements at the beginning...
Address of created newnode :11605688
Inserted value is :7
Intersecting Elements at the beginning...
Address of created newnode :11605704
Inserted value is :6
Intersecting Elements at the beginning...
Address of created newnode :11601072
Inserted value is :5
Here is the result of union: 567891234Here is the result of intersection: List is empty.