2.cpp

来自「数据结构课程设计」· C++ 代码 · 共 23 行

//销毁的的概念是怎样的
#include "head.h"
void	main2(h_list	&lead)
{
	link	p,q;
	while(lead->length)
	{
		p=lead->assistant[lead->length-1]->tou;
		q=p;
		p=p->next;
		while(p)
		{
			q=p;
			p=p->next;
			free(q);
		}
		free(lead->assistant[lead->length-1]);
		lead->length--;
	}
	free(lead);
	printf("已销毁线性表!!!");
}