# Various operations on Polynomials using linked List

#include<math.h>
#include<stdio.h>
#include<conio.h>
typedef struct node
{
int xpower;
int ypower;
float coeff;
struct node *next;
}node;
void main()
{
int option;
float x,value;
do
{
printf("\n1 : create 1'st polynomial");
printf("\n2 : create 2'nd polynomial");
printf("\n4 : Quit");
scanf("%d",&option);
switch(option)
{
printf("\n1'st polynomial -> ");
printf("\n2'nd polynomial -> ");
printf("\n Sum = ");
break;
}
}while(option!=4);
}
{
int n, i, xpower,ypower;
float coeff;
node t;
printf("\n Enter number of terms :");
scanf("%d",&n);
for (i=0;i<n;i++)
{

printf("\nenter a term(powerof x,power of y,  coeff.)");
scanf("%d%d%f",&xpower,&ypower,&coeff);
t.xpower=xpower;
t.ypower=ypower;
t.coeff=coeff;
}
}
{
return;
}

{
node t;
{
{
}
else
{
}
else
{
}
}
{
}
{
}
}
{
int i;
node *p,*q;
p=(node*)malloc(sizeof(node));
*p=t;//t is copied to newly acquired node
p->next=NULL;
{  //insert at the beginning
}

/*locate the point of insertion*/