#include<stdio.h>//include all the require header file
#include<stdlib.h>//for executing the function
#include<stdbool.h>//this is specially require for boolean operation
//-----Define the Node-----//
typedef struct node //declaration of struct node
{
int data;//data is of int type which will hold the value
struct node *next;//struct node pointer *next is pointing to the next node address
}Node;
static Node *head1,*head2,*head,*head_union,*head_intersection,*newnode,*tail,*res_union,*res_intersection;
//-----Define the functions-----//
Node *insert_node(Node *head_ref,int n);
void display_list(Node *head_ref);//function used to display node data
Node *get_union(Node *head_pointer1,Node *head_pointer2);
Node *get_intersection(Node *head_pointer1,Node *head_pointer2);
int compare(Node *head,int data);
int main() //declaration of main function
{
int first_list_nodes = 0,second_list_nodes = 0,first_list_items = 0,
second_list_items = 0;
printf("Enter the number of Nodes in first List:");//ask the user to input how many nodes are their
fflush(stdout);//print the above statement in standard output
scanf("%d",&first_list_nodes);//store the value in variable name first_list_node
printf("Enter %d the elements:",first_list_nodes);//now enter the elements one by one
for(int i = 0;i < first_list_nodes;i++)
{
fflush(stdout);
scanf("%d",&first_list_items);
head1 = insert_node(head1,first_list_items);
}
display_list(head1);
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(int i = 0;i < second_list_nodes;i++)
{
fflush(stdout);
scanf("%d",&second_list_items);
head2 = insert_node(head2,second_list_items);
}
display_list(head2);
res_union = get_union(head1,head2);
printf("Here is the result of union: ");
display_list(res_union);
res_intersection = get_intersection(head1,head2);
printf("Here is the result of intersection: ");
display_list(res_intersection);
}
void display_list(Node *head_ref)
{
if(head_ref == 0)
{
printf(" List is empty.");
}
else
{
tail = head_ref;
while(tail != 0)
{
printf("%d ", tail->data);// prints the data of current node
tail = tail->next;// advances the position of current node
}
tail = newnode;
}
}
Node *insert_node(Node *head_ref,int n)
{
printf("\nInserting Elements at the beginning...\n");
newnode =(Node*) malloc(sizeof(Node));
printf("Address of created newnode :%d\n",newnode);
newnode->data = n;
printf("Inserted value is :%d\n",newnode->data);
newnode->next = head_ref;
head_ref = newnode;
return head_ref;
}
Node *get_union(Node *head_pointer1,Node *head_pointer2)
{
while(head_pointer1 != 0)
{
head_union = insert_node(head_union,head_pointer1->data);
head_pointer1 = head_pointer1->next;
}
while(head_pointer2 != 0)
{
if(!compare(head_union,head_pointer2->data))
head_union = insert_node(head_union,head_pointer2->data);
head_pointer2 = head_pointer2->next;
}
return head_union;
}
int compare(Node *head,int data)
{
while (head != NULL)
{
if (head->data == data)
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))
head_intersection = insert_node(head_intersection,head_pointer1->data);
head_pointer1 = head_pointer1->next;
}
return head_intersection;
}