dnode.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 class DNode implements Position {
    private DNode next, prev;
    private Object element;
    
    public DNode(){
    	
    }

    public DNode(Object element, DNode prev, DNode next) {
        this.element = element;
        this.prev = prev;
        this.next = next;
    }

    public DNode getNext(){
    	return this.next;
    }
    
    public DNode getPrev(){
    	return this.prev;
    }
    
    public void setNext(DNode next){
    	this.next = next;
    }
    
    public void setPrev(DNode prev){
    	this.prev = prev;
    }
    
    public Object element() throws InvalidPositionException {
        if ((prev == null) && (next == null))
            throw new InvalidPositionException();
        return element;
    }
    
    
}