Using Queue/Stacks with classes and Nodes

[chee]

so basically this programs works, but with 1 problem and i know how to fix it, but don't know how to put the code in.

the error i get when i put the code i want in is

Cannot use template 'Node1<T>' without specifying specialization parameters

#include <iostream.h>
#include <fstream.h>
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <string.h>

class Node1{
public:
int data1;
Node1 *next1;
};

template<class T>
class Queue1{
protected:
T data1;
Node1 *front1, *rear1;
T size1;
T full;
public:
Queue1(T n1=10){size1=0; full=n1;};
~Queue1(){};
int isEmpty(){return !(size1);};
// int isFull(){return !(full-size1);};
void enqueue(T );
int dequeue();
void peekAll();
void peekTop();
};

template <class T>
void Queue1<T>::enqueue(T num){
// if(isFull())
// cout << "\n\n\tList is Full..";
//else{
Node1 *new1 = new Node1;
new1->data1=num;
new1->next1=NULL;
if(isEmpty()){
front1=new1;
rear1=new1;
}
else{
rear1->next1=new1;
rear1=new1;
}

size1+=1; // }

}

template <class T>
void Queue1<T>::peekAll(){
Queue1 temp(size1);
T num;
T size=size1;
cout << "\tList: H-> ";
for(int i=0; i<size; i++){
num = Queue1::dequeue();
cout << num << " ";
temp.enqueue(num);
}
for(int i=0; i<size; i++){
num= temp.dequeue();
Queue1::enqueue(num);
}

}


template <class T>
int Queue1<T>::dequeue(){
T value;
if(isEmpty()) cout << "\n\n\tEmpty....";
else{
Node1 *temp;
temp=front1;
value=front1->data1;
front1=front1->next1;
delete temp; size1-=1;
}

return value;


}

template <class T>
void Queue1<T>::peekTop(){
if(! isEmpty() ) cout << Queue1::front1->data1;
else cout << "\n\n\tList <Empty>";
}

cout << "\n\n\tSelect queue type (defualt=int)";
cout << "\n\n\t1.int 2.char 3.double 0.exit >> ";
cin >> gogo;


if(gogo==1){
int size=0;
int num1;
Queue1<int>s1(num1);
cout << "\n\n";
for(int i=0; i<10; i++){
cout << "\tEnter integer <0 to quit> >> ";
cin >> num1;
if(num1==0) break;
s1.enqueue(num1);
size++;
}

cout << "\n\tEnqueue complete-----------";
cout << "\n"; s1.peekAll();
cout << "\n\tDequeue-stack---------------------"…
for(int i=0; i<size-1; i++){
cout << "\n\t"; s1.peekTop(); s1.dequeue(); s1.peekAll();
}
cout << "\n\t"; s1.peekTop();
}

else if(gogo==2){
char c1;
int size=0;
Queue1<char>s2(c1);
cout << "\n\n";
for(int i=0; i<10; i++){
cout << "\tEnter character <0 to quit> >> ";
cin >> c1;
if(c1=='0') break;
s2.enqueue(c1);
size++;
}
cout << "\n\tEnqueue complete-----------";
cout << "\n"; s2.peekAll();
cout << "\n\tDequeue-stack---------------------"…
for(int i=0; i<size-1; i++){
cout << "\n\t"; s2.peekTop(); s2.dequeue(); s2.peekAll();
}
cout << "\n\t"; s2.peekTop();
}

in this working code i am able to run it and it works, but when i select the character option i can put in the letters, but it wont read the tops because of the very top class. here is the code with the error, but i know

here is the code im using that doesn't has the error, but i know is the right theory code because when i changed the 'int data' to 'char data' it would let me use the peektop function to look at the last letter. so here is the code

template <class T>
class Node1{
public:
int data1;
Node1 *next1;
};

Cannot use template 'Node1<T>' without specifying specialization parameters

so how would i can i fix the node1 class and use template

[ne555]

template <class T>
class Node1{
public:
int data1;
Node1<T> *next1;
};