c++数据结构一元多项式求和

方法一般，时间复杂度高，请前辈指教

首先定义节点类型

template<class DataType>
struct Node
{
	DataType data;
	Node<DataType> *next;
};
struct elem
{
	int coef;
	int exp;
};

将LinkList的泛型指定为elem，并初始化。（个人小白，能力有限，未能想到好的结构体数组初始化方法）

elem Polynomial1[5];
	for (int i = 0; i < 5; i++)
	{
		elem elem1 = { i + 1,i + 1 };
		Polynomial1[i] = elem1;
	}
	elem Polynomial2[5];
	for (int i = 0; i < 5; i++)
	{
		elem elem1 = { i + 1,i + 1 };
		Polynomial2[i] = elem1;
	}

void AddPolynomial(LinkList<elem> &a, LinkList<elem> b)
{
	Node<elem> *pre = new Node<elem>;
	Node<elem> *qre = new Node<elem>;
	Node<elem> *p = new Node<elem>;
	Node<elem> *q = new Node<elem>;
	No