Algorithmen und Datenstrukturen Vorlesungsskript WS/SS 99-00

8. Grundlegende Datenstrukturen
Stack implementiert mit linked list
Variablen: Node top, int size
push(object o): void
Node n:=new Node();
n.setElement(o);
n.setNext(top); top:=n;
size:=size+1
pop(): object
e:=top.getElement();
top:=top.getNext();
size:=size-1; return e
size(): integer
return size
isEmpty(): boolean
return top = null
top(): object
return top.getElement()
Interface Stack
public interface Stack {
public int size();
public boolean isEmpty();
public Object top()
throws StackException;
public void push(Object element);
public Object pop()
throws StackException;
}
StackException
public class StackException
extends RuntimeException {
public StackException(String err) {
super(err);
}
}
156