栈链式存储

 class Snode
    {
        int data;
        Snode next;

        public int Data { get { return data; } set { data = value; } }
        public Snode Next { get { return next; } set { next = value; } }
        public Snode() { }

        public Snode(int data) { this.data = data; }
    }

    class S_List
    {
        Snode top;

        public S_List() { }

        public S_List(Snode _top) { top = _top; }

        public Snode Top { get { return top; } set { top = value; } }

        public void Push(int data)
        {
            Snode q = new Snode(data);

            if (top == null)
                top = q;
            else
            {
                q.Next = top;
                top = q;
            }
        }

        public int Pop()
        {
            int temp = -1;
            if (top == null)
                return temp;
            else
            {
                temp = top.Data;
                top = top.Next;
            }

            return temp;
        }

        public void Print()
        {
            if (top == null) return;
            Snode p = top;
            while (p.Next != null)
            {
                Console.WriteLine(p.Data);
                p = p.Next;
            }

            Console.WriteLine(p.Data);
        }
    }