Aim : Implementation of Polynomial arithmetic using linked list.

Theory

A polynomial is represented as a sum of terms, where each term has a coefficient and an exponent. Using linked lists, we can dynamically store and manipulate polynomials.

🔹 Why Use Linked Lists for Polynomials?

• Dynamic allocation allows efficient memory usage.
• Insertion and deletion operations are simpler compared to arrays.
• Easy representation of sparse polynomials.

📌 Algorithm

1. Representation of Polynomial

• Each term is stored in a node with fields: coefficient, exponent, and next pointer.
• The polynomial is stored as a linked list in decreasing order of exponents.

2. Polynomial Addition

• Traverse both polynomials simultaneously.
• If exponents match, add coefficients and store in result.
• If one exponent is greater, add that term to the result.
• Continue until both lists are exhausted.