// DoubleLinkedList.cpp : 定义控制台应用程序的入口点。
//构造双向链表，实现从控制台输入，插入，删除，求大小size等操作
#include "stdafx.h"
#include
using namespace std;
//定义双向链表的节点
template
struct NODE
{
 NODE* pre;
 T data;
 NODE* next;
};
//定义双向链表容器
template
class DoubleLinkedList
{
public:
 DoubleLinkedList()
 {
  NODE* q = new NODE;
  if (q == NULL)
  {
   cout data = NULL;
  phead->next = NULL;

  T i;
  cout i)
  {
   NODE* p = new NODE;
   if (p == NULL)
   {
    cout next = p;
   p->pre = q;
   p->next = NULL;
   q = q->next;
  }
 }

 //容器大小方法
 int size()
 {
  NODE* p = phead->next;
  int count(0);
  while (p != NULL)
  {
   count++;
   p = p->next;
  }
  return count;
 }

 //输出DoubleLinkedLIst中的元素
 void print_elements()
 {
  NODE* p = phead->next;
  while (p != NULL)
  {
   cout data next;
  }
  cout next;
   }
   NODE* n = m->next;
   NODE* p = new NODE;
   if (p == NULL)
   {
    cout pre = m;
   p->data = e;
   p->next = n;
   n->pre = p;
  }
  else if (i == (this->size()+1))
  {
   NODE* m = phead;
   for (int j = 1; j < i; j++)
   {
    m = m->next;
   }
   NODE* p = new NODE;
   if (p == NULL)
   {
    cout pre = m;
   p->data = e;
   p->next = NULL;
  }
  else
  {
   cout next;
   if (p == NULL)
   {//所要删除的元素超过list的范围
    cout next = n;
   n->pre = m;
   delete p;
  }
  else
  {//删除元素为最后一个
   NODE* m = p->pre;
   m->next = NULL;
   delete p;
  }
 }
private:
 NODE* phead;
};
int _tmain(int argc, _TCHAR* argv[])
{
 //测试代码
  DoubleLinkedList mylist;
 mylist.print_elements();
 cout