由於兩種資料結構的結點結構體都較為簡單，這裡就不列出了

a.單鏈表

List creatList1(List T,int n) //建立單鏈表 (頭插法)
{
int x;Position S;
T = new struct Node;
T->Next = NULL;
for(int i = 0;i < n;i++)
{
S = new struct Node;
cin>>x;
S->Data = x;
S->Next = T->Next;
T->Next = S;
}
return T;
}

交換相鄰結點演算法：

void SwapAdjNode1(List T,Position P1,Position P2)
{
if(P1->Next!=P2)
{
cout<<"不是相鄰結點";
return;
}
else
{
PtrToNode P0;
P0 = FindPrevious(P1->Data,T);
P1 = P2->Next;
P2->Next = P1;
P0->Next = P2;
return;
}
}

b:雙鏈表

List creatList2(List T,int n) //建立雙向連結串列
{
Position rear = T; //尾插法需要定義一個尾指標
Position S;
T = new struct Node;
T->Next= NULL;
T->prior = NULL;
for(int i = 0;i < n;i++)
{
S = new struct Node; //尾插法
cin>>S->Data;
rear->Next = S;
head->prior = S;
S->prior = rear;
S->Next = head;
rear = S;
}
return T;
}

交換相鄰結點演算法：

void SwapAdjNode2(List T,Position p1,Position p2)
{
 Position P0 = FindPrevious(p1->Data,List T); 
 Position P3 = p2->Next;
 if(P1->Next!=P2)
 {
  cout<<"不是相鄰結點";
  return;
 }
 else
 {
  P0->Next = p2;
  p1->Next = p3;
  p1->prior = p2;
  p2->Next = p1;
  p2->prior = p0;
  p3->prior = p1;
 } }

這裡列出FindPreviou演算法實現：

Position FindPrevious(DataType x,List T)  //尋找前置結點;
{
 PtrToNode p;
 p = T;
 while(p->Next!=NULL&&p->Next->Data!=x)
 {
  p = p->Next;
 }
 if(p->Next == NULL)
 {
  return NULL;
 }
 else return p;
}