<分区>
对于我的作业，我必须创建一个单链表并插入 3 个项目。我尝试使用面向对象的方法，而不是我的老师和几乎所有人都使用的纯指针方法； head 和 tail 都是我的列表类的节点和属性。我的代码的唯一问题是头节点的指针不会更新到下一个节点。谁能帮我改正这个问题？
#include <iostream>
using namespace std;
class node
{
public:
int element;
node* ptr;
friend class list;
};
class list
{
public:
//Including head and tail attributes and making them public so that
they are easily accessible to anyone using the linked list construction
node head;
node tail;
list()
{
head.element = -1; //-1 is sentinel value
tail.element = -1;
head.ptr = NULL;
tail.ptr = NULL;
head = tail;
}
bool empty()
{
return((head.ptr == NULL) && (head.element == -1));
}
void insert(int a)
{
if(empty())
{
head.element = a;
tail.element = a;
}
else
{
//Making a new unnamed node, inserting the new value, and
updating the tail attribute
node* v = new node;
tail.ptr = v;
v -> element = a;
v -> ptr = NULL;
tail.element = v-> element;
tail.ptr = v -> ptr;
}
}
void print()
{
int i = 0;
node *pointer = head.ptr;
while(pointer != NULL)
{
cout << "The " << i+1 << "th element is: " << pointer ->
element;
pointer = pointer -> ptr;
i++;
}
}
};
int main()
{
int values[3] = {1, 2, 3};
list lst;
for(int i = 0; i < 3; i++)
{
lst.insert(values[i]);
}
cout << lst.head.element << endl;
cout << lst.tail.element;
lst.print();
};