// BinaryTree Demo

import java.util.Scanner;
public class BinaryTreeDemo
{

  public static void main(String[] args)
  {		// 12 7 15 89 17
    		BinaryTree bt = new BinaryTree();
    		// insert all ..
    		bt.insert(12);
    		bt.insert(7);
    		bt.insert(15);
    		bt.insert(89);
    		bt.insert(17);

    		bt.print();
    		// try to find if num (from the keyboard) is there
    		//	output the message
    		Scanner input = new Scanner(System.in);
    		System.out.print("\n\nInput the item to look up from tree: ");
    		int num = input.nextInt();
    		if(bt.lookup(num))
    			System.out.println(num + " is in the tree!.\n\n");
    		else
    			System.out.println(num + " is NOT in the tree!.\n\n");

    		System.out.println("Bye.\n\n");
    }
 }