设计一个函数模板IsEqual，比较实验四、五涉及到的五种类的对象是否相等，定义如果两个对象的m_ID相等，那么它们就相等。

设计一个链表的类模板，只用实现插入（bool LinkedList::InsertAt(Node *p, int index)）和删除（bool LinkedList::DeleteAt(int index)）两种操作即可。如果插入时index大于链表的长度则将新节点接到链表的末尾，如果删除时index大于链表的长度则删除最末尾的节点，index从0开始计数-Design a function template IsEqual, experiment four or five of the five kinds of objects related to equality, defined If the two objects m_ID equal, then they are equal. The design of a linked list class template, insert (bool LinkedList :: InsertAt (Node* p, int index)), and delete (bool LinkedList :: DeleteAt (int index)) two modes of operation can be used to achieve. If you insert the index is greater than the length of the linked list of the new node receiving the end of the list, if you delete the index is greater than the length of the list is deleted at the end node, index starts counting from 0