3.2给你一个链表L和另一个链表P,它们包含以升序排列的整数。操作PrintLots(L,P)将打印L中那些由P所指定位置上的元素。
#include <stdio.h>
#include <stdlib.h>
#define ElementType int
struct Node;
typedef struct Node *PtrToNode;
typedef PtrToNode List;
typedef PtrToNode Position;
List MakeEmpty(List L);
int IsEmpty(List L);
int IsLast(List L);
Position Find(ElementType X,List L);
void Delete(ElementType X,List L);
Position FindPrevious(ElementType X,List L);
void Insert(ElementType X,List L,Position P);
void DeleteList(List L);
Position Header(List L);
Position First(List L);
Position Advance(Position P);
ElementType Retrieve(Position P);
struct Node
{
ElementType Element;
Position Next;
};
int IsEmpty(List L)
{
return L->Next == NULL;
}
int IsLast(Position P,List L)
{
return P->Next == NULL;
}
Position Find(ElementType X,List L)
{
Position P;
P = L->Next;
while(P != NULL && P->Element != X)
P &