把一个新的节点数据插入链表，使该节点在链表中位置是nPos；

从链表中删除第一个和 rNode相等的节点；

删除链表中第 nPos个节点 ，释放该节点的空间；

返回和rNode相等的节点；

将链表按节点从小到大排序；

清空整个链表；

delete每一个节点返回指定位置的节点数据如 nPos不对，则返回NU-put a new data nodes inserted List so that the nodes are located Linklist nPos; Listless deleted from paragraph 1 and rNode equal to the node; Listless delete paragraph nPos nodes, the nodes of the release of the space; RNode return and the same node; According to Chain nodes from small to large sequencing; clear the entire list; delete each node to return to a location designated as the nodal data nPos wrong, it returns NU