java栈的实现（链表型）

//节点对象
package stack;
public class LinkNode<T> {
    private T date;
    private  LinkNode next;
    public T getDate() {
        return date;
    }
    public void setDate(T date) {
        this.date = date;
    }
    public LinkNode getNext() {
        return next;
    }
    public void setNext(LinkNode next) {
        this.next = next;
    }
}


//实现类
package stack;

public class LinkedStack<T> {
    //栈底指针
    private LinkNode base;
    //栈顶指针
    private LinkNode top;
    //栈的当前大小
    private Integer size;


    /**
     * 栈的初始化
     */
   public void InitStack() {

        top = base = new LinkNode();
        size = 0;
    }


    /**
     * 获取栈的大小
     */
    public int StackLenth() {
        return this.size;
    }

    /**
     * 获取栈顶元素
     */
    public T GetTop() {
        return (T) top.getDate();
    }

    /**
     * 入栈
     */
    public void Push(T e) {
        LinkNode<T> newNode =