结构体:
typedef struct LNode
{
int data;
struct LNode *next;
}LNode,*LinkList;
实现算法:
void DeletePre(LinkList &L,LNode *p)
{
LNode *pre = L;
LNode *q;
while(pre->next->next != p)
{
pre = pre->next;
}//此循环找到结点p
q = pre->next;//暂时存放p的前驱结点
pre->next = p;
delete q;
}