Polynomial addition is implemented using ______ data structure.

A Linked List is the most efficient data structure for polynomial addition. Each node represents a term containing a coefficient, an exponent, and a pointer to the next term. It dynamically handles any number of non-zero terms sorted by exponent order without wasting contiguous memory space. The correct option is C.