单链表初始化
int LinkEmpty(LinkList& L)
{
if (L->next)
return 0;
else return 1;
}
判断链表是否为空
Status InitList(LinkList& L)
{
L = new LNode;
L->next = NULL;
return OK;
}
单链表的销毁
Status DestroyList(LinkList L)
{
LNode* p;
while (L)
{
P = L;
L = L->next;
delete p;
}
return OK;
}
清空单链表
Status ClearLink(LinkList L)
{
LNode* p,,* q;
p = L->next;
while (p)
{
q = p->next;
delete p;
p = q;
}
L->next = NULL;
return OK;
}
求链表的表长
Status LinkLength_L(LinkList L)
{
LNode* p;
int i = 0;
p = L->next;
while (p)
{
i++;
p = p->next;
}
return OK;
}