A polynomial may be represented as a linked list where each

A polynomial may be represented as a linked list where each node contains the coefficient and exponent of a term of the polynomial. The polynomial 4 X^3 - 3 X^2 - 5 would be represented as the linked list. Write a program system that reads two polynomials, stores them as linked lists, adds them together, and prints the result as a polynomial. The result should be a third linked list. Travers both polynomials. If a particular exponent value is present in cither of the two polynomials being summed, then it should be present in the answer. If it is present in both polynomials, then its coefficient is the sum of the corresponding coefficient in both polynomials. (If this sum is zero, the term should be deleted).

Solution

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

typedef struct link
{
    int coeff;
    int pow;
    struct link * next;
} my_poly;

      void my_create_poly(my_poly **);
      void my_show_poly(my_poly *);
      void my_add_poly(my_poly **, my_poly *, my_poly *);

int main(void)
{
    int ch;
  
    do {
        my_poly * poly1, * poly2, * poly3;

        printf(\"\ Create 1st expression\ \");
        my_create_poly(&poly1);
        printf(\"\ Stored the 1st expression\");
        my_show_poly(poly1);

        printf(\"\ Create 2nd expression\ \");
        my_create_poly(&poly2);
        printf(\"\ Stored the 2nd expression\");
        my_show_poly(poly2);

        my_add_poly(&poly3, poly1, poly2);
        my_show_poly(poly3);

        printf(\"\ Add two more expressions? (Y = 1/N = 0): \");

        scanf(\"%d\", &ch);

    } while (ch);
    return 0;
}

     void my_create_poly(my_poly ** node)
{
    int flag;
    int coeff, pow;
    my_poly * tmp_node;
    tmp_node = (my_poly *) malloc(sizeof(my_poly));
    *node = tmp_node;
    do
{
      
        printf(\"\ Enter Coeff:\");
        scanf(\"%d\", &coeff);
        tmp_node->coeff = coeff;
        printf(\"\ Enter Pow:\");
        scanf(\"%d\", &pow);
        tmp_node->pow = pow;
      

     
        tmp_node->next = NULL;

      
        printf(\"\ Continue adding more terms to the polynomial list?(Y = 1/N = 0): \");

        scanf(\"%d\", &flag);

        //printf(\"\ FLAG: %c\ \", flag);
      
        if(flag)
{
            tmp_node->next = (my_poly *) malloc(sizeof(my_poly)); //Grow the list
            tmp_node = tmp_node->next;
            tmp_node->next = NULL;
     
}
    } while (flag);
}

void my_show_poly(my_poly * node)
{
    printf(\"\ The polynomial expression is:\ \");

    while(node != NULL)
{
        printf(\"%dx^%d\", node->coeff, node->pow);
        node = node->next;
        if(node != NULL)
            printf(\" + \");
    }
}

void my_add_poly(my_poly ** result, my_poly * poly1, my_poly * poly2)
{
    my_poly * tmp_node;

    tmp_node = (my_poly *) malloc(sizeof(my_poly));
    tmp_node->next = NULL;
    *result = tmp_node;

    while(poly1 && poly2)
{

        if (poly1->pow > poly2->pow)
{
            tmp_node->pow = poly1->pow;
            tmp_node->coeff = poly1->coeff;
            poly1 = poly1->next;
        }
        else if (poly1->pow < poly2->pow)
{
            tmp_node->pow = poly2->pow;
            tmp_node->coeff = poly2->coeff;
            poly2 = poly2->next;
        }
        else
{
            tmp_node->pow = poly1->pow;
            tmp_node->coeff = poly1->coeff + poly2->coeff;
            poly1 = poly1->next;
            poly2 = poly2->next;
        }

      
        if(poly1 && poly2)
{
            tmp_node->next = (my_poly *) malloc(sizeof(my_poly));
            tmp_node = tmp_node->next;
            tmp_node->next = NULL;
        }
    }

  

    while(poly1 || poly2)
{
      

      

        tmp_node->next = (my_poly *) malloc(sizeof(my_poly));
        tmp_node = tmp_node->next;
        tmp_node->next = NULL;

        if(poly1)
{
            tmp_node->pow = poly1->pow;
            tmp_node->coeff = poly1->coeff;
            poly1 = poly1->next;
        }
        if(poly2)
{
            tmp_node->pow = poly2->pow;
            tmp_node->coeff = poly2->coeff;
            poly2 = poly2->next;
        }
    }

    printf(\"\ Addition Complete\");
}

output:

Create 1st expression

Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):
Enter Coeff:
Enter Pow:
Continue adding more terms to the polynomial list?(Y = 1/N = 0):