tree.java

用java实现的LinkedList二叉树

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

/**
 * @author dieks
 *
 * TODO To change the template for this generated type comment go to
 * Window - Preferences - Java - Code Style - Code Templates
 */
public interface Tree {
	public Position root();
    public Position parent(Position p) throws InvalidPositionException;
    public Iterator children(Position p) throws InvalidPositionException;
    public boolean isInternal(Position p) throws InvalidPositionException;
    public boolean isExternal(Position p) throws InvalidPositionException;
    public boolean isRoot(Position p) throws InvalidPositionException;
    public Object replace(Position p, Object e) throws InvalidPositionException;
	public int size();
	//public int depth(Tree t, Position p);
	//public int height(Tree t, Position p);
	public boolean isEmpty();
	public Iterator positions();
	public Iterator elements();
}