Polynomial Addition Using Linked List Algorithm

Polynomial Addition Using Linked List Algorithm
Watch More Videos at:
Lecture By: Mr. Arnab Chakraborty, Tutorials Point India Private Limited.

[TutorialsPoint_]

Use coupon ""YOUTUBE12"" to get “FLAT 12%’’ OFF at Checkout.

[covidnineteen]

I usually do not comment on YouTube videos but this video is a MASTERPIECE. Thank you Arnab sir.Our professor took an entire hour to explain this thing but I couldn't imbibe an ounce of knowledge from her. Arnab sir rocks!

[omkaragawane]

thankyou sir you explained it very well i too understand the algo easily because of that diagram you explained in the previous lesson

[avraz]

Can we have the actual code for the function above please

[jayanthiarumugam]

Superb explanation sir.i want explanation about avl tree in data structures.please upload sir immediately.

[ronodeepgupta]

In the while loops the condition will be

while(ptr1 and ptr2)
while(ptrr)
and in the last line it should be ptr=NULL or else there will be empty node with only its next field as null. Otherwise good explanation!

[AnkitSaiyan]

Program is wrong!
Algo is wrong!
how can you even read last Node if you put (ptr1->next & ptr2->next) in while loop?
it should be (ptr1 && ptr2) dont you think?

[poojithapapineni]

Sir, Can we have Polynomial subtraction, multiplication Using Linked List Algorithm ?

[simplyskincare]

Is that algorithm or Puesudo code?? Can we write it in exam

[shivanshusuryakar]

In while loop there should be " or" than " and" because he explained using !

[Anagha_VK]

How to implimet polynomial using array

[nagasairamtaluri]

Try to explain logic how to write the code

[anime_thrones_endgame]

Peddayana.... Neeku maa basha vachaa... Cheppu🙄🤔🤔🤔

[nammkyarakhah]

THIS IS THE EXACT ALGO YOU WANT\n\n
struct polynode* add(struct polynode *x, struct polynode *y)
{
struct polynode *z, *z1, *a;
int flag;
z=creatpoly();
z1=z;
while(1)
{
if(x->exp==y->exp)
{

z1->exp=x->exp;
z1->next=NULL;
x=x->next;
y=y->next;
}
else if(x->exp>y->exp)
{
z1->coeff=x->coeff;
z1->exp=x->exp;
x=x->next;
}
else{
z1->coeff=y->coeff;
z1->exp=y->exp;
y=y->next;
}
if(!(x&&y))
break;
z1->next=creatpoly();
z1=z1->next;

}

if(x==NULL)
a=y;
else
a=x;
while(a)
{
z1->next=creatpoly();
z1=z1->next;
z1->coeff=a->coeff;
z1->exp=a->exp;

a=a->next;
}
z1->next=NULL;
return z;
}