betterlinkednode.java

来自「国外的数据结构与算法分析用书」· Java 代码 · 共 44 行

package simple;

public class BetterLinkedNode
{
	/**	contents of cell */
	public Object item; 
	
	/**	pointer to next node */
	public BetterLinkedNode nextNode; 
	
	/**	set item equal to x
		Analysis: Time = O(1) */
	public BetterLinkedNode(Object x)
	{
		setItem(x);
	}
	
	/**	set item equal to x 
		Analysis: Time = O(1) */
	public void setItem(Object x)
	{
		item = x;
	}
	
	/**	set nextNode equal to x 
		Analysis: Time = O(1) */
	public void setNextNode(BetterLinkedNode x)
	{
		nextNode = x;
	}
	
	/**	string representation suitable for output 
		Analysis: Time = O(n), where n = number of nodes linked from this node */
	public String toString()
	{
		String temp = new String();
		temp = item.toString();
		if (nextNode!=null)
			temp = temp + " " + nextNode.toString();
		return temp;
	}
	
}