线性表链式存储

1.访问：...................................O(n)

for (t=head; i!=0; t=t->next) i--;

return t->item;

2.插入：insert(x, y, t)............O(1)

t->next = y; 

x->next = t;

3.删除：remove(x, y)...........O(1)

x->next = y->next;