单链表初始化出了问题，第二个的指针地址是CDCDCD，主函数了里面

当然没接上，你那个for循环是什么玩意，pnode=pnode–>next，这里的next是未初始化和未分配内存的节点，你再次进入循环分配新节点也并未把这个next链接到上面，还有链表的优点是需要时候在分配内存，你这个初始化函数上来就分配这么多节点是什么意图，如果这样还不如用数组！

template<typename T>
class LinkedList
{
private:
struct Node
{
T value;
Node * next;
};
Node * head;
Node * tail;
Node * prev;
public:
LinkedList() : head(NULL), tail(NULL), prev(NULL) {}
~LinkedList()
{
Node * pnode = head;
while(pnode != tail)
{
Node * pnext = pnode->next;
delete pnode;
pnode = pnext;
}
}
void Add(const T & t)
{
Node * pnode = new Node;
pnode->value = t;
pnode->next = NULL;
if(head == NULL)
{
head = pnode;
}
else
{
prev->next = pnode;
}
prev = pnode->next;
tail = pnode->next;
}
};

我用纯C这样写也没问题
#include <stdio.h>
#include <malloc.h>
struct Node
{
char ch;
Node * next;
};
struct CharList
{
Node * head;
Node * tail;
Node * prev;
};
void InitCharList(CharList * list)
{
list->head = list->tail = list->prev = NULL;
}
void CharListAdd(CharList * list, char ch)
{
Node * pnew = (Node *) malloc (sizeof(Node));
pnew->ch = ch;
pnew->next = NULL;
if(list->head == NULL)
{
list->head = pnew;
}
else
{
list->prev->next = pnew;
}
list->prev = pnew;
list->tail = pnew->next;
}
void DeleteElem(CharList * list, int index/*第几个下标开始*/, int length/*删除往后的几个*/)
{
if(index == 0)//index == 0需要单独拎出讨论
{
Node * pnode = list->head;
for(int i = 0; i < length; i++)
{
Node * pnode_next = pnode->next;
delete pnode;
pnode = pnode_next;
}
list->head = pnode;//重置head
return;
}
Node * pnode_prev = list->head;
for(int i = 0; i < index - 1/*使pnode_prev指向删除的元素前一个元素*/; i++)
{
pnode_prev = pnode_prev->next;
}
Node * pnode_end = pnode_prev;
for(int i = 0; i < length; i++)
{
pnode_end = pnode_end->next;
}
Node * pnode = pnode_prev->next;
while(pnode != pnode_end)
{
Node * pnext = pnode->next;
delete pnode;
pnode = pnext;
}
pnode_prev->next = pnode_end->next;
return;
}
void DestroyCharList(CharList * list)
{
Node * pnode = list->head;
while(pnode != list->tail)
{
Node * psave = pnode->next;
free(pnode);
pnode = psave;
}
}
int main()
{
CharList charlist1;
::InitCharList(&charlist1);
//将26个字母添加入链表
for(int i = 0; i < 26; i++)
::CharListAdd(&charlist1, 'A' + i);
::DeleteElem(&charlist1, 0, 25);
::CharListAdd(&charlist1, 'A');
//显示链表元素
Node * ptr = charlist1.head;
while(ptr != charlist1.tail)
{
printf("%c", ptr->ch);
ptr = ptr->next;
}
::DestroyCharList(&charlist1);
return 0;
}

//问题解决了，注意DatasetAdd中else中循环的条件，不能把NULL赋给ptr_move
#include <iostream>
using std::cout;
using std::endl;
#define ADT char//抽象类数据类型
typedef struct Node
{
ADT value;
Node * next;
} * Dataset;
//初始化数据集
void InitDataset(Dataset & head)
{
head = NULL;
}
//尾接数据
void DatasetAdd(Dataset & head, const ADT & adt)
{
Node * pnode = (Node *)malloc(sizeof(Node));
pnode->value = adt;
pnode->next = NULL;
if(head == NULL)//若数据集为空
{
head = pnode;
}
else
{
Node * ptr_move = head;
while(ptr_move->next != NULL)
{
ptr_move = ptr_move->next;
}//指向tail
ptr_move->next = pnode;
}
}
//清空数据集
void ReleaseDataset(Dataset & head)
{
Node * pnode = head;
while(pnode != NULL)
{
Node * pnext = pnode->next;
free(pnode);
pnode = pnext;
}
head = NULL;
}
void Display(Dataset & head)
{
Node * pnode = head;
while(pnode != NULL)
{
std::cout<<pnode->value<<std::endl;
pnode = pnode->next;
}
}
int main()
{
Dataset charset;
::InitDataset(charset);
for(int i = 0; i < 26; i++)
::DatasetAdd(charset, 'A' + i);
::Display(charset);
::ReleaseDataset(charset);
return 0;
}