Language C++

Consider a sparse implementation of the ADT polynomial that stores only the terms with nonzero coef cients. For example, you can represent the revised polynomial p in Exercise 9 of Chapter 1 with the linked chain shown in Figure 4-10.

a. Complete the sparse implementation.

b. De ne a traverse operation for the ADT polynomial that will allow you to add two sparse polynomials without having to consider terms with zero coef cients explicitly.

FIGURE 4-10 A sparse polynomial degree headPtr coeff power next