资 源 简 介
数据结构的基本操作：链式存储结构实现一元多项式的所有基本操作，包括在多项式链表P中顺序插入结点e,插入后结点按指数从小到大排列等-The basic operation of data structures: Linked Storage Structure unary polynomial realization of all the basic operations, including the list in the polynomial P in the order of insertion node e, inserted nodes exponentially from small to large array, etc.
