【算法】链表

#include<iostream>
#include<cstdlib>
typedef struct Node *L_size;
typedef L_size List;
typedef L_size position;

struct Node  //节点 
{
	char c;
	position next;
};

void Insert(char x_1,List l,position p)  //插入表 
{
	position tmp;
	tmp = (position)malloc(sizeof(struct Node));
	if(tmp = NULL)
		throw("out of space");
	tmp->next = p ->next;
	tmp->c = x_1;
	p->next = tmp;
}
void DeleteList(List l)  //删除表 
{
	position p,tmp;
	p = l->next;
	l->next =NULL;
	while(p != NULL)
	{
		tmp = p->next;
		free(p);
		p = tmp;
	}
}
position Find(char c_1,List l)  //寻找 
{
	position p;
	p = l->next;
	while(p != NULL && p->c != c_1)
		p = p->next;
	return p;
}
position FindLeft(char c_1,List l)  //找到元素的前地址 
{
	position p;
	p = l;
	while(p->next != NULL && p->next->c != c_1)
		p = p->next;
	return p;
}

void Delete(char c, List l)   //删除 
{
	position p,tmp; 
	p = FindLeft(c,l);
	if(p->next != NULL)
	{
		tmp = p->next;
		p->next = tmp->next;
		free(tmp);
	}
}
int main()
{
	List L;
	
	return 0;
}