public static void main(String[] args) {
		TreeNode root = new TreeNode(40);
		TreeNode curr = root;
		curr.left = new TreeNode(25);
		curr.right = new TreeNode(78);
		curr = curr.left;
		curr.left = new TreeNode(10);
		curr.right = new TreeNode(32);
		
		BinarySearchTree bst = new BinarySearchTree();
		//min
		System.out.println("min:"+bst.Minimum(root));
		//min
		System.out.println("max:"+bst.Maximum(root));
		
		// inorder
		System.out.println("\ninorder:");
		PrinterOrder(bst.inorderTraversal(root));
		// postorder
		System.out.println("\npostorder:");
		PrinterOrder(bst.postorderTraversal(root));
		
		System.out.println("\npreorder2:");
		PrinterOrder(bst.preorderTraversal(root));
	}