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

live batch(preeti)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>


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_intersect,*newnode,*tail,*result_union,*result_intersect;//declaring the different variable in structure type

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 transferring address if the list to tail
	        while(tail != 0)//checking the value is not equal to 0
	        {
	            printf("%d ", tail->data);// prints the data of current node
	            tail = tail->next;// advances the position of current node
	        }
	        tail = newnode;//tail redeclared to new node
	    }
}

int compare(Node *head,int data)
{
    while (head != NULL)
    {
        if (head->data == data)//comparing the data of list 2 with list 1
            return 1;
        head = head->next;
    }
    return 0;
}


Node *insert_node(Node *head_ref,int n)//function used create the new list
{
		printf("\nInserting Elements at the beginning...\n");
		newnode =(Node*) malloc(sizeof(Node));//allocating the memory to the nodes
		printf("Address of created new node :%p\n",newnode);//prints the address of the new node
		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 transfered 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)
	{
			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)
	{
		if(!compare(head_union,head_pointer2->data))//Here we are  inserting the element from list 2 number which not in the list1 for making union function
		head_union = insert_node(head_union,head_pointer2->data);//inserting the element not in the list2
		head_pointer2 = head_pointer2->next;//Traveling to next node
	}
	return head_union;
}

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 for intersection
        	head_intersect = insert_node(head_intersect,head_pointer1->data);//transferring the that value to the intersection
        head_pointer1 = head_pointer1->next;
    }

    return head_intersect;
}


int main()
{

		int first_list = 0,second_list= 0,first_list_items = 0,
				second_list_items = 0;
		int x;
		printf("Enter the number of Nodes in first List:");
		fflush(stdout);
		scanf("%d",&first_list);
		printf("\nEnter %d the elements:",first_list);//getting the number of element in the lists
		for( x = 0;x< first_list;x++)
		{
			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("\n\nEnter the number of Nodes in the second List:");
		fflush(stdout);
		scanf("%d",&second_list);
		printf("\nEnter %d the elements:",second_list);
		for(x = 0;x < second_list;x++)
		{
			fflush(stdout);
			scanf("%d",&second_list_items);//getting the data from user in run time
			head2 = insert_node(head2,second_list_items);
		}
		display_list(head2);//displaying the head1 list
		result_union = get_union(head1,head2);//transferring the result of union function to the res union
		printf("\n\n\nHere is the result of union:");
		display_list(result_union);//transferring the values as arguments to display function
		result_intersect = get_intersection(head1,head2);//transferring the result of intersection function to the res intersection

		printf("\n\n\nHere is the result of intersection: ");//transferring the result of intersection function to the res intersection
		display_list(result_intersect);//transferring the values as arguments to display function

}

output: