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

#include
#include
#include

typedef struct node//defining the structure
{
int data;//creating the data type of the variable
struct node *next;//creating self referential
}
Node;//changing the structure name as as node
static Node *head1,*head2,*head,*head_union, *head_intersection,*newnode,*tail,*res_union,*res_intersection;
//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);//prints the of current nodes
tail=tail->next;//advances the position of currentnode
}
tail =newnode;
}
}
Node *insert_node(Node *head_ref,int n)//function used create the new list
{
printf("\n inserting elements at the begining...\n");
newnode=(Node*)malloc(sizeof(Node));//allocating the memory to the nodes
printf("address of created newnode :%d\n",newnode);
newnode->data=n;//assiging the value to he 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;//transferred the new address to te 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 transfering 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 inseerting the elements from list 2 number were not in the union function
head_union=insert_node(head_union,head_pointer2->data);//travelling to next node
head_pointer2=head_pointer2->next;

}
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 list 1
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 list for intersection
head_intersection=insert_node(head_intersection,head_pointer1->data);//transferring the that valueto 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;
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 first_list_nodes
for(f=0;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 List
}
display_list(head1);//displaying the head1 list
printf("\nEnter the number of nodes in the second list: ");
fflush(stdout);
scanf("%d",&second_list_nodes);
printf("Enter %d the elements : ",second_list_nodes);
for(f=0;f {
fflush(stdout);
scanf("%d",&second_list_items);//getting the data in run time
head2=insert_node(head2,second_list_items);
}
display_list(head2);//displaying the head1 list
res_union=get_union(head1,head2);//transfering the resultof union function to the res union
printf("Here is the result of union: ");
display_list(res_union);
printf("Here is the result of intersection: ");//transfering the result of intersection function to the res intersection
display_list(res_intersection);//transfering the values as arguments to displayfunction
}