链表栈

链表节点

ListNode.h

#include "stdafx.h"
#include<iostream>
using namespace std;
template <typename Type>  class LinkStack;
template <typename Type> 
// 链表节点
class ListNode{
private:
    friend class LinkStack<Type>;
    ListNode():p_next(NULL){}
    ListNode(Type item , ListNode<Type>*next=NULL):data(item),p_next(next){}
    ~ListNode(){
        p_next=NULL;
    }
private:
    Type data;  // 节点数据
    ListNode<Type>*p_next;  //下一个节点
};

栈节点

LinkNode.h

#include "ListNode.h"
template <typename Type>
class LinkStack{
public:
    LinkStack():p_top(NULL){}
    ~LinkStack(){
        makeEmpty();
    }
public:
    void makeEmpty();   // 清空
    bool push(Type item);  // 入栈
    Type pop();  // 出栈
    Type getTop();  // 获取栈首元素
    void print();  // 打印
    bool isEmpty(){   // 判空
        return p_top==NULL; 
    }
private:
    ListNode<Type>*p_top;
};
template<typename Type>
void LinkStack<Type>::makeEmpty(){
    ListNode<Type>*pdel;
    while(p_top!=NULL){
        pdel = p_top;
        p_top = p_top->p_next;
        delete pdel;
    }
}
template <typename Type>
bool LinkStack<Type>::push(Type item){
    ListNode<Type>*temp = new ListNode<Type>(item);
    if(temp==NULL){
        cout << "filed push item:"<<item<<endl;
        return false;
    }
    temp->p_next = p_top;
    p_top = temp;
    return true;
}
template <typename Type>
Type LinkStack<Type>::pop(){
    if(isEmpty()){
        cout << "stack is empty , can't pop the element"<<endl;
        exit(0);
    }
    ListNode<Type>*temp = p_top;
    p_top = p_top->p_next;
    Type item = temp->data;
    delete temp;
    return item;
}

template <typename Type>
Type LinkStack<Type>::getTop(){
    if(isEmpty()){
        cout << "stack is empty"<<endl;
        exit(0);
    }
    return p_top->data;
}
template <typename Type>
void LinkStack<Type>::print(){
    if(isEmpty()){
        cout << "stack is empty"<<endl;
        exit(0);
    }
    ListNode<Type>*pmove = p_top;
    cout << "stack";
    while(pmove!=NULL){
        cout << "->" << pmove->data;
        pmove = pmove->p_next;
    }
    cout << endl << endl;
}