Queue/Stack ADTs with templates.

[rustyboy]

Hi people,
First time poster, I have been trying to implement a basic Queue structure using templates. I am using VS2008 and I keep getting LNK2019 whenever I try deqeueing items.
I have set it up so you pass the Queue the data type to be stored and upon queueing an item it creates a node that holds a pointer to the template but more importantly when I dequeue an item I return the class data rather than the node.
Could I get some pointers on sorting this issue out. Code below

Node class:

template <class T>
class Node
{
public:
	Node<T>();
	Node<T>(T* n);
	void setNext(Node* n);//Can't pass const Node* as you can't}   Well, there was some error or other
	void setPrev(Node* n);//assign a const value to a variable }
	Node* getNext(void)const;
	Node* getPrev(void)const;
	void setData(T* data);
	T* getData(void);
private:
	Node<T>* next;
	Node<T>* previous;
	T* pData;
};

//Code omitted

template <class T>
Node<T>::Node(T* n)
{
	pData = n;
	next = 0;
	previous = 0;
}

//code omitted

template <class T>
void setData(T* data)
{
	pData = data;
}

template <class T>
T* getData(void)
{
	return pData;
}

Queue Structure:

#include "Node.h"

template <class T> 

class Queue
{
public:
	Queue<T>(void);
	~Queue<T>(void);
	void queue(T* n);
	T* dequeue(void);
	int getQueueSize(void);
private:
	Node<T>* headNode;
	Node<T>* tailNode;
	int size;
};

template <class T>
Queue<T>::Queue()
{
	headNode = new Node<T>;
	tailNode = new Node<T>;
	headNode->setNext(tailNode);
	tailNode->setPrev(headNode);
}

template <class T>
Queue<T>::~Queue(void)
{
	delete headNode;
}

template <class T>
void Queue<T>::queue(T* n)
{
	Node<T>* pNode = new Node<T>(n);
	pNode->setNext(tailNode);
	pNode->setPrev(tailNode->getPrev());
	size++;
}

template <class T>
T* Queue<T>::dequeue(void)
{
	if(size>0)
	{
		Node<T>* pNode = headNode->getNext();
		headNode->setNext(pNode->getNext());
		size--;
		return pNode->getData();
	}
}

Thanks all, great site!

[Bazzy]

You forgot Node<T>:: on lines 32 and 38

[rustyboy]

I knew it, rookie mistake :D
Knew I should have been a carpenter.

[Bazzy]

Try to implement a binary tree then ;-)

[rustyboy]

Thanks for the tip