1．建立一个堆栈类模板，其中堆栈数据用链表存放。

struct SNode{
char data;
SNode *next;
};

void StackAndQueue::InitialStack(SNode *&top)
{
top = NULL;
}
int StackAndQueue::PushStackNode(char value, SNode *&top)
{
SNode *p = new SNode;
//ﾅﾐｶﾏﾕｻｽﾚｵ飜ﾇｷ�ﾖﾅ莎ﾉｹｦ
if(NULL == p)
{
return ALLOT_FILD;
}
p->data = value;
p->next = top;
top = p;
return SUCCESSFUL;
}
int StackAndQueue::PopStackNode(char &cData, SNode *&top)
{
//ﾅﾐｶﾏﾕｻﾊﾇｷ�ｪｿﾕ
if(NULL == top)
{
return SPILL_OVER;
}
SNode *p = top;
cData = p->data;
top = p->next;
delete p;
return SUCCESSFUL;
}
这是我以前写的，自己改成模版吧，下面是一段10进制转8进制的检验程序，不过当时我只检验了数组堆栈，还是需要你自己改一下。

int StackAndQueue::conversion(int number, int &iData)
{
iData = 0;
Stack dataStack;
InitialStack(dataStack);
//ﾅﾐｶﾏｴｦﾀ桢・
while(number)
{
//ﾅﾐｶﾏﾊﾇｷ�・ｻｳﾉｹｦ
if(SUCCESSFUL != PushStack(dataStack, number % 8))
{
return NOP_WANTED;
}
number /= 8;
}
int tmp = 0;
//ﾅﾐｶﾏﾊﾇｷ��ｻｳﾉｹｦ
while(SUCCESSFUL == PopStack(dataStack, tmp))
{
iData = iData + tmp * pow(10, (dataStack.top + 1));
}
return SUCCESSFUL;
}

如果你想要，我还有数组堆栈以及队列的代码，只不过当时是写的中文注释，现在在日文系统下无法正常显示。
#include

#define SUCCESSFUL 0 //ｲﾙﾗ�ﾉｹｦ
#define ALLOT_FILD -1 //ｷﾖﾅ萋ﾚｴ贲ｧｰﾜ
#define NOP_WANTED -2 //ﾃｻﾓﾐﾐ靥ｪｵﾄｽ荡・
#define SPILL_OVER -3 //ﾒ邉・

#define StackSize 100 //ﾋｳﾐ�ｻｵﾄﾗ鋗�ﾝﾁｿ
#define QueueSize 100 //ﾋｳﾐ�ﾓﾁﾐｵﾄﾗ鋗�､ｶﾈ

//ﾋｳﾐ�ｻｵﾄｽ荡ｹ
struct Stack{
int data[StackSize];
int top;
};

//ﾁｴﾕｻｵﾄｽﾚｵ膻荡ｹ
struct SNode{
char data;
SNode *next;
};

//ﾋｳﾐ�ﾓﾁﾐｵﾄｽ荡ｹ
struct Queue{
int data[QueueSize];
int front;
int rear;
};

//ﾁｴｶﾓﾁﾐｵﾄｽﾚｵ膻荡ｹ
struct QNode{
char data;
QNode *next;
};

class StackAndQueue
{
public:
StackAndQueue();
virtual ~StackAndQueue();

public:
//ﾊｮｽ�ﾆﾗｪｰﾋｽ�ﾆ
int conversion(int number, int &iData);
//ｳ�ｼｻｯﾋｳﾐ�ｻ
void InitialStack(Stack &dataStack);
//ｳ�ｼｻｯﾁｴﾕｻ
void InitialStack(SNode *&top);
//ﾈ・ｳﾐ�ｻ
int PushStack(Stack &dataStack, int value);
//ｳ�ｳﾐ�ｻ
int PopStack(Stack &dataStack, int &iData);
//ﾈ・ｴﾕｻ
int PushStackNode(char value, SNode *&top);
//ｳ�ｴﾕｻ
int PopStackNode(char &cData, SNode *&top);
//ｳ�ｼｻｯﾋｳﾐ�ﾓﾁﾐ
void InitialQueue(Queue &dataQueue);
//ｳ�ｼｻｯﾁｴｶﾓﾁﾐ
int InitialQueue(QNode *&front, QNode *&rear);
//ﾈ・ｳﾐ�ﾓﾁﾐ
int PushQueue(Queue &dataQueue, int value);
//ｳ�ｳﾐ�ﾓﾁﾐ
int PopQueue(Queue &dataQueue, int &iData);
//ﾈ・ｴｶﾓﾁﾐ
int PushQueueNode(char value, QNode *front, QNode *&rear);
//ｳ�ｴｶﾓﾁﾐ
int PopQueueNode(char &cData, QNode *&front, QNode *&rear);

};

才这么点分啊！！那我就少些点啦！
typedef int datatype
void push(pointer s, datatype x)\\进栈的函数\\
{p=(pointer*)malloc(sizeof(node));
p->data=x;
p->next=s->next;
s->next=p;
}
datatype pop(pointer s) \\出栈\\
{if(s->next==null)return(null);
else
{p=s->next;
x=p->data;
s->next=p-next;
free(p);
return(x);
}
}
先写些关键的

struct
SNode{
char
data;
SNode
*next;
};
void
StackAndQueue::InitialStack(SNode
*&top)
{
top
=
NULL;
}
int
StackAndQueue::PushStackNode(char
value,
SNode
*&top)
{
SNode
*p
=
new
SNode;
//ﾅﾐｶﾏﾕｻｽﾚｵ飜ﾇｷ?ﾖﾅ莎ﾉｹｦ
if(NULL
==
p)
{
return
ALLOT_FILD;
}
p->data
=
value;
p->next
=
top;
top
=
p;
return
SUCCESSFUL;
}
int
StackAndQueue::PopStackNode(char
&cData,
SNode
*&top)
{
//ﾅﾐｶﾏﾕｻﾊﾇｷ?ｪｿﾕ
if(NULL
==
top)
{
return
SPILL_OVER;
}
SNode
*p
=
top;
cData
=
p->data;
top
=
p->next;
delete
p;
return
SUCCESSFUL;
}
这是我以前写的，自己改成模版吧，下面是一段10进制转8进制的检验程序，不过当时我只检验了数组堆栈，还是需要你自己改一下。
int
StackAndQueue::conversion(int
number,
int
&iData)
{
iData
=
0;
Stack
dataStack;
InitialStack(dataStack);
//ﾅﾐｶﾏｴｦﾀ桢・
while(number)
{
//ﾅﾐｶﾏﾊﾇｷ?・ｻｳﾉｹｦ
if(SUCCESSFUL
!=
PushStack(dataStack,
number
%
8))
{
return
NOP_WANTED;
}
number
/=
8;
}
int
tmp
=
0;
//ﾅﾐｶﾏﾊﾇｷ??ｻｳﾉｹｦ
while(SUCCESSFUL
==
PopStack(dataStack,
tmp))
{
iData
=
iData
+
tmp
*
pow(10,
(dataStack.top
+
1));
}
return
SUCCESSFUL;
}
如果你想要，我还有数组堆栈以及队列的代码，只不过当时是写的中文注释，现在在日文系统下无法正常显示。
#include

#define
SUCCESSFUL
0
//ｲﾙﾗ?ﾉｹｦ
#define
ALLOT_FILD
-1
//ｷﾖﾅ萋ﾚｴ贲ｧｰﾜ
#define
NOP_WANTED
-2
//ﾃｻﾓﾐﾐ靥ｪｵﾄｽ荡・
#define
SPILL_OVER
-3
//ﾒ邉・
#define
StackSize
100
//ﾋｳﾐ?ｻｵﾄﾗ鋗?ﾝﾁｿ
#define
QueueSize
100
//ﾋｳﾐ?ﾓﾁﾐｵﾄﾗ鋗?､ｶﾈ
//ﾋｳﾐ?ｻｵﾄｽ荡ｹ
struct
Stack{
int
data[StackSize];
int
top;
};
//ﾁｴﾕｻｵﾄｽﾚｵ膻荡ｹ
struct
SNode{
char
data;
SNode
*next;
};
//ﾋｳﾐ?ﾓﾁﾐｵﾄｽ荡ｹ
struct
Queue{
int
data[QueueSize];
int
front;
int
rear;
};
//ﾁｴｶﾓﾁﾐｵﾄｽﾚｵ膻荡ｹ
struct
QNode{
char
data;
QNode
*next;
};
class
StackAndQueue
{
public:
StackAndQueue();
virtual
~StackAndQueue();
public:
//ﾊｮｽ?ﾆﾗｪｰﾋｽ?ﾆ
int
conversion(int
number,
int
&iData);
//ｳ?ｼｻｯﾋｳﾐ?ｻ
void
InitialStack(Stack
&dataStack);
//ｳ?ｼｻｯﾁｴﾕｻ
void
InitialStack(SNode
*&top);
//ﾈ・ｳﾐ?ｻ
int
PushStack(Stack
&dataStack,
int
value);
//ｳ?ｳﾐ?ｻ
int
PopStack(Stack
&dataStack,
int
&iData);
//ﾈ・ｴﾕｻ
int
PushStackNode(char
value,
SNode
*&top);
//ｳ?ｴﾕｻ
int
PopStackNode(char
&cData,
SNode
*&top);
//ｳ?ｼｻｯﾋｳﾐ?ﾓﾁﾐ
void
InitialQueue(Queue
&dataQueue);
//ｳ?ｼｻｯﾁｴｶﾓﾁﾐ
int
InitialQueue(QNode
*&front,
QNode
*&rear);
//ﾈ・ｳﾐ?ﾓﾁﾐ
int
PushQueue(Queue
&dataQueue,
int
value);
//ｳ?ｳﾐ?ﾓﾁﾐ
int
PopQueue(Queue
&dataQueue,
int
&iData);
//ﾈ・ｴｶﾓﾁﾐ
int
PushQueueNode(char
value,
QNode
*front,
QNode
*&rear);
//ｳ?ｴｶﾓﾁﾐ
int
PopQueueNode(char
&cData,
QNode
*&front,
QNode
*&rear);
};