public interface Stack<K>
A stack must provide the classical push(Object) and
pop() operations, but may be also peekable
to some extent: it may provide just the top() function,
or even a more powerful peek(int) method that provides
access to all elements on the stack (indexed from the top, which
has index 0).
void push(K o)
o - the object that will become the new top of the stack.K pop()
NoSuchElementException - if the stack is empty.boolean isEmpty()
K top()
NoSuchElementException - if the stack is empty.K peek(int i)
i-th element on the stack; 0 represents the top.IndexOutOfBoundsException - if the designated element does not exist..Copyright © 2011-2015. All Rights Reserved.