My understand of stack and queue

First:Abstract
    stack and queue have the same logical structure like linear list. But the stack only can write and read at one side of the list; the queue only can write at one side of the list and read at the other side of the list.
Second:
    1,stack:
        (1)
        include  "top pointer"  "bottom pointer"  "stack size"
        feature:FILO:first in last out
        (2)create way
        down:
            top point to the high address while bottom point to the low address
            when "pop" top--  "push" top++
        up:
            opposite compare above
        (3)abstract data type
            common stack
            typedef struct
            {
                int *base;
                int *top;
                int stacksize;
            } Stack;
            link stack
            typedef struct SNode
            {
                int data;
                struct SNode *next;
            } SNode, *LinkStack;
     2,queue