public class Preorder {
	
	public static void preOrder(BNode node) {

		if (node != null) {
			
			System.out.print((String) node.getElement() + " ");
			
			if (node.getLeftChild()!=null) {
				preOrder(node.getLeftChild());
			}
		
			if (node.getRightChild()!=null) {
				preOrder(node.getRightChild());
			}

		}

	}
	public static void main(String[] args) {
		 /* generate a BinaryTree bt with 9 nodes */ 
		BinaryTree bt = new BinaryTree();
		BNode root = bt.addRoot("6");
		BNode two = bt.insertLeft(root, "2");
		BNode eight = bt.insertRight(root, "8");
		BNode one = bt.insertLeft(two, "1");
		BNode four = bt.insertRight(two, "4");
		BNode three = bt.insertLeft(four, "3");
		BNode five = bt.insertRight(four, "5");
		BNode seven = bt.insertLeft(eight, "7");
		BNode nine = bt.insertRight(eight, "9");
		
		System.out.println("The Preorder traversal result is:");
		preOrder(bt.root());
	}

}