使用由结构形成的链表来存放数据；总保障，在

把第i个数据插入到链表以前，链表中当前已有的i-1个数据已经是有序的（i=1，2，…，

即是说，每次总是在原有有序链表的适当位置插入新数据，而保障插入后的链表仍有序。-The use of the structure formed by the linked list to store data　total protection at the first i put data into the list before the list is currently available i-1 data is already ordered (i = 1,2, ... In other words, each time in an orderly manner in the original list is always the appropriate place to insert new data, and protect the insertion after the list is still in an orderly manner.