데이터구조(다항식+링크드리스트)

typedef struct node *pointer;
typedef struct node
{
int coef; // 계수(coef)
int expon; // 지수(expon)
pointer link; // 노드 포인터
}node;

pointer firstPolyHead, secondPolynomial, resultPolynomial; // 다항식의 최상위 포인터

// 함수선언

pointer PolynomialRead();
pointer nodeCreate(char* polyarray);
void PolynomialWrite(pointer polynomial);
pointer cpadd(pointer first, pointer second);
void attach(int coefficient, int exponent, pointer *ptr);
pointer psub(pointer first, pointer second);
pointer pmult(pointer first, pointer second);
void eval(pointer polynomial, double f);
void cerase(pointer *ptr);

void print_menu();
void submenu_read();
void submenu_write();
void submenu_add();
void submenu_substract();
void submenu_eval();