binarytreetest.java

用java实现的LinkedList二叉树

/*
 * Created on 2005-10-30
 *
 * 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 class BinaryTreeTest {
	public static void main(String args[]){
		Object element = "A";
		
		LinkedBinaryTree lbt = new LinkedBinaryTree();
		
		lbt.addRoot(element);
		
		BTNode root = lbt.checkPosition(lbt.root());
		
		lbt.expandExternal(root, "B", "C");
		lbt.expandExternal(root.getLeft(), "D", "E");
		lbt.expandExternal(root.getRight(), "F", "G");
		lbt.expandExternal(root.getRight().getLeft(), "H", "I");
		
		//lbt.remove(root.getLeft().getLeft());
		//lbt.remove(root.getLeft().getRight());
		
		lbt.expandExternal(root.getRight().getLeft().getRight(), "J", "K");
		
		//lbt.insertLeft(root.getLeft().getLeft(), "L");
		//lbt.insertRight(root.getLeft().getLeft(), "M");
		
		//lbt.rightChild(root.getRight());
		//lbt.leftChild(root.getRight());
		//lbt.sibling(root.getLeft());
		//lbt.parent(root.getRight());
		
		System.out.println("The depth of the root is: " +LinkedBinaryTree.depth( lbt, root.getRight().getLeft().getRight().getLeft()));
		System.out.println("The height of the tree: "+ LinkedBinaryTree.treeHeight(lbt));
		System.out.println("The height of I: "+ LinkedBinaryTree.height(lbt, root.getRight().getLeft().getRight()));
		System.out.println("The size: " + lbt.size());
		
		lbt.printTree();
		
	}
}