常用数据结构---双链表

// DoubleList.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
using std::cout;
using std::endl;

typedef struct tagDoubleList
{
 int nData;
 struct tagDoubleList *pPrior;
 struct tagDoubleList *pNext;
}DoubleList_S;

int _tmain(int argc, _TCHAR* argv[])
{
 DoubleList_S *pNode1 = new DoubleList_S;
 pNode1->nData = 1;
 pNode1->pPrior = NULL;
 pNode1->pNext = NULL;

 DoubleList_S *pNode2 = new DoubleList_S;
 pNode2->nData = 2;
 pNode2->pPrior = NULL;
 pNode2->pNext = NULL;

 DoubleList_S *pNode3 = new DoubleList_S;
 pNode3->nData = 3;
 pNode3->pPrior = NULL;
 pNode3->pNext = NULL;

 //将节点1和节点3连接起来
 pNode1->pNext = pNode3;
 pNode3->pPrior = pNode1;

 //插入节点2
 pNode2->pNext = pNode3->pPrior->pNext;
 pNode3->pPrior->pNext = pNode2;
 pNode2->pPrior = pNode3->pPrior;
 pNode3->pPrior = pNode2;

 //删除节点2
 pNode1->pNext = pNode2->pNext;
 pNode3->pPrior = pNode2->pPrior;

 if (pNode1)
 {
  delete pNode1;
  pNode1 = NULL;
 }
 if (pNode2)
 {
  delete pNode2;
  pNode2 = NULL;
 }
 if (pNode3)
 {
  delete pNode3;
  pNode3 = NULL;
 }

 return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值