polynomial ADT class
<p>I have trouble understanding use of high level ADT in a polynomial class. What i was given is</p>

<pre><code>typedef struct term{
  double coef; 
  unsigned deg; 
  struct term * next;
}term_t;
typedef struct term * Term;
typedef struct term * Poly;
</code></pre>

<p>So this is said to be low level ADT, but i have to use high level ADT which means that I have to make a class. What I am starting doing is</p>

<pre><code>class Polynomial{
private:
    typedef struct term{
        double coef;
        unsigned deg;
        struct term * next;
    }term_t;
    typedef struct term *Term;
    typedef struct term *Poly;
public:
    Polynomial(); //Constructor
    ~Polynomial(); //Destructor     
}
</code></pre>

<p>My problem is an understating the change of low level to ADT to high level ADT. Should the function be private but then accessed through a public functions? Is this basically like a polynomial linked list polynomial class? Is my start good? So term and poly will be a pointers to the coef and deg?</p>
