public class Main {
	public static void main(String[] args) {

		AVLtree avl = new AVLtree();
		int[] a = { 30, 80, 50, 40, 20, 60, 70, 10, 90, 95 };
		for (int i = 0; i < a.length; i++)
			avl.insert(a[i]);
		System.out.println("\nAVL Tree nodes in sorted order:");
		avl.printTree();
		avl.insert(15);
		avl.insert(85);
		System.out.println("\n\nAfter insertion of 15 & 85");
		avl.printTree();
		int item = 82; 
		if (avl.search(item))
			System.out.println("\n\n" + item + " found");
		else
			System.out.println("\n\n" + item + " not found");

	}
}