数据结构 多项式的加减乘法

// 多项式的运算.cpp : 定义控制台应用程序的入口点。
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <string.h>
#define TRUE                        1
#define FALSE                       0
#define POSITIVE                    1
#define NEGATIVE                   -1

typedef int status;
typedef struct NodeType 
{
    float fCoeff;
    int iExpon;
    struct NodeType *next;
} NodeType, *LinkType;
typedef LinkType polynomial;
typedef polynomial *PolyPointer;

status MakePolyBuff(PolyPointer *, const int);
status MakeNode(polynomial *, const float, const int);
void AppNodeToList(polynomial *, polynomial);             /* 在链表尾追加结点*/
status CreatePolyn(PolyPointer, int);
status ProcStrError(const char[]);              /* 检查输入的数据*/
void SortPolyn(PolyPointer, int);                    /* 根据iExpon域对链表进行升序排序*/
void DestroyBuff(PolyPointer, const int);
void DestroyPolyn(polynomial);
int PolynLength(const polynomial);                          /* 求链表的长度*/
void AddProcess(PolyPointer, const int, PolyPointer, const int);

void SubstractProcess(PolyPointer, const int, PolyPointer);
void MultiplyProcess(PolyPointer, const int, PolyPointer);
void PrintPolyn(const polynomial);
void MergePolynCoeff(PolyPointer, int);           /* 在有序链表中,合并同类项*/

int main(void)
{
    int iCounter, 
        iPolyNum;                            /* 多项式链表缓冲区中链表的个数*/
    PolyPointer PolyBuff = NULL;             /* 用户输入的多项式链表缓冲区*/
    polynomial PolyAddRes = NULL,            /* 存放连加结果链表*/
               PolySubRes = NULL,            /* 存放连减结果链表*/
               PolyMulRes = NULL;            /* 存放连乘结果链表*/
    char strNum[10];

    do
    {
        printf("请输入需要构造多项式的个数,至少2个: ");
        gets(strNum); 
        iPolyNum = atoi(strNum);
    } while (iPolyNum < 2);

    MakePolyBuff(&PolyBuff, iPolyNum);
    CreatePolyn(PolyBuff, iPolyNum);
    SortPolyn(PolyBuff, iPolyNum);
    MergePolynCoeff(PolyBuff, iPolyNum);
    printf("\n打印用户输入并整合后的多项式:\n");
    for (iCounter = 0; iCounter < iPolyNum; iCounter++)
    {
        printf("第%d个项式:\n", iCounter + 1);