list.java

用java实现的LinkedList二叉树

/*
 * Created on 2005-10-18
 *
 * TODO To change the template for this generated file go to
 * Window - Preferences - Java - Code Style - Code Templates
 */

/**
 * @author dieks
 *
 * TODO To change the template for this generated type comment go to
 * Window - Preferences - Java - Code Style - Code Templates
 */

package linkedBinaryTree;

public interface List {
	public int size();
    public boolean isEmpty();
    public Position first();
    public Position last();
    public Position prev(Position p) throws BoundaryViolationException;
    public Position next(Position p) throws BoundaryViolationException;

    public Position insertFirst(Object e);
    public Position insertLast(Object e);
    public Position insertBefore(Position p, Object e) throws InvalidPositionException;
    public Position insertAfter(Position p, Object e) throws InvalidPositionException;
    public Object replace(Position p, Object e) throws InvalidPositionException;
    public Object remove(Position p) throws InvalidPositionException;

}