binarynode.java

java的二叉树的实现参考

public class BinaryNode implements BinNode 
{
	private Object item;
	private BinNode left,right;

/**
 *
 */
public BinaryNode(){
	//fill your code here.
	left=right=null;
	item=null;
}

/**
 *
 */
public BinaryNode(Object obj){
	//fill your code here.
	left=right=null;
	item=obj;
}

/**
 *
 */
public Object element(){
	//fill your code here.
	return item;
}

/**
 *
 */
public Object setElement(Object obj){
	//fill your code here.
	item=obj;
	return obj;
}

/**
 *
 */
public BinNode left(){
	//fill your code here.
	return left;
}

/**
 *
 */
public BinNode setLeft(BinNode p){
	//fill your code here.
	left=p;
	return p;
}

/**
 *
 */
public BinNode right(){
	//fill your code here.
	return right;
}

/**
 *
 */
public BinNode setRight(BinNode p){
	//fill your code here.
	right=p;
	return p;
}

/**
 *
 */
public boolean isLeaf(){
	//fill your code here.
	return (left==null)&&(right==null);
}

}