Doubly Linked List printing problem

[soldier1984]

I can't figure out how to write the display function. I want a function to print the array backwards and a function that prints it forward. But I'm unable to write even the simple one.

  #include <iostream>
using namespace std;

struct node
{
	node* prev;
	int data;
	node* next;
};

class dlinkedlist
{
	node* first; 
	node* last;  
public:
	dlinkedlist()
	{
		first = NULL;
		last = NULL;
	}

	void addItem(int d)
	{
		node* pNode = new node;
		pNode->data = d;
		pNode->prev = first;
		pNode->next = last;
		if(pNode->prev != NULL)
		{
			pNode->prev = first;
			pNode->next = NULL;
		}
		last = pNode;
	}

	void display()
	{
		node* current = first;
		for(current = first; current != NULL; current = current->next)
		{
			cout << current->data << endl;
		}
	}
};

int main()
{
	int nValues;
	int values;

	dlinkedlist mydLL;

	cout << "How many values: ";
	cin  >> nValues;
	cout << "Enter " << nValues << " values:\n";

	for(;nValues != 0; nValues--)
	{
		cin  >> values;
		mydLL.addItem(values);
	}

	cout << endl;
	mydLL.display();

	cout << endl;
	system("pause");
}

[kbw]

What's wrong with display()? It looks ok to me.

[soldier1984]

it displays the list in reverse order. What do i do to prevent that?

[kbw]

it displays the list in reverse order.

Perhaps the data is inserted incorrectly.

If addItem() is adding entries to the front, it should look like:

	void addItem(int d)
	{
		node* pNode = new node;
		pNode->data = d;

		if (first == NULL && last == NULL)
		{
			// insert first item
			pNode->next = last;
			pNode->prev = first;
			first = last = pNode;
		}
		else
		{
			pNode->next = first;
			pNode->prev = NULL;
			first = pNode;
		}
	}