说明：  已知线性表的元素按递增顺序排列，并以带头结点的单链表作存储结构。试编写—个删除表中所有值大于min且小于max的元素(若表中存在这样的元素)的算法程序。
(Linear table of elements known by increasing order, and to take the lead in a single node list for the storage structure. Test preparation- a deletion of the table all the value is greater than min and less than the max of the elements (if there is no such table elements) algorithm procedures.)