printwordtree.java

为什么这个网站要弄这么麻烦啊？？真是搞不明白

public class PrintWordTree

{	
	public static void inorder(LinkedBinaryTree bt, Position po)
	{
		if (bt.isInternal(po))
		{
			inorder(bt, bt.leftChild(po));		
			System.out.print("Total number of instances of "+((Item)(po.element())).key());
			System.out.println(" = "+ ((Item)(po.element())).element());
			inorder(bt, bt.rightChild(po));					
		}
	}
}