CIrcular Arrays

[Bgreen7887]

Suppose a classed name undostack implements a stack that allows unlimited pushes by forgetting old data as described above by using a circular arry.the data is stored inj a private array memeber declared as Object data[]. Private data meber B is the index of the bottom element in the stack. Member T is the top of the stack.Member C is the count of how many objects are in the stack.......

i wrote the constructor as

public UndoStack(initialSize){ //constructor
            data = new Object[initialSize];
            t=0;
            b=data.length-1;
            c=0

I WANTED TO ASK CAN ANYONE GUIDE ME TO HOW I WRITE A BASIC PUSH AND POP METHOD??

[masijade]

I wouldn't. I'd use the Stack class.