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

overview:

1)In use for linkedlist are insert node,display list,get union,get intersection,compare are use.

2)inser node: new node creat the newly created node,get union:in compare the value  same value not no retun print

3)get intersection:A campare the node 1&2 same value in print the value

Goals:

1)In print  enter the number of nodes in first list and number of elements print and  second list nodes & element

2)The print of get union,get intersection

Key highlight of the project:

1)In use of two node in liked list a method malloc=(node*)malloc(sizeof(node)

2)The method of newnode and head ref are use head and tail display function

3)A union operation is campare of two list value are same not re print

Deliverbles of  this project:

1)The use of insert node is newnode of print value of two list in insert

2)In use of union of while loop use

3)The are print in one of the union in two list in head point of next value

Expeacted outcome:

1)node is use vale and data is address of node in next is self referential pointer node.

2)next is used to store the address of node structure

3)In union and intersection are use in  structure

4)Intersection:in campare two list value in same value in print