Interface StackADT<T>

All Known Implementing Classes:

Stack

public interface StackADT<T>

A First In Last Out data structure that also provides a method to return the stack in reverse order. DO NOT EDIT OR HAND IN THIS INTERFACE

Method Summary

Modifier and Type	Method and Description
boolean	isEmpty() Returns true iff if this Stack is empty
T	peek() Returns the element from the top of Stack, without removing it from the stack.
T	pop() Returns and removes the element from the top of Stack, If the stack is empty, throws java.util.EmptyStackException
void	push(T data) Add the data item to top of the Stack.
StackADT<T>	reverse() Creates a new Stack with the items of this stack in the reverse order.

Method Detail

isEmpty

boolean isEmpty()

Returns true iff if this Stack is empty

Returns:

true if stack is empty

push

void push(T data)
   throws java.lang.IllegalArgumentException

Add the data item to top of the Stack. If data is null, throw IllegalArgumentException

Parameters:

data - the data item to add to top of stack

Throws:

java.lang.IllegalArgumentException - if data is null

peek

T peek()
throws java.util.EmptyStackException

Returns the element from the top of Stack, without removing it from the stack. If the stack is empty, throws java.util.EmptyStackException

Returns:

the data item at top of stack without removing it

Throws:

java.util.EmptyStackException - if called on empty stack

pop

T pop()
throws java.util.EmptyStackException

Returns and removes the element from the top of Stack, If the stack is empty, throws java.util.EmptyStackException

Returns:

the data item at the top of the stack

Throws:

java.util.EmptyStackException - if called with no items in the stack

reverse

StackADT<T> reverse()

Creates a new Stack with the items of this stack in the reverse order. The items in this stack remainin in the same order. If this stack is empty, the reverse order stack is also empty.

Returns:

a stack with the same items reversed