public class BinaryTree
   {
      public TreeNode head;
   
       public BinaryTree()
      {
         head = null;
      }
   
       public void addElement(int element)
      {
         if (head == null)
            head = new TreeNode(element);
         else
         {
            TreeNode aNode = new TreeNode(element);
            addNode(head, aNode);
         }
      
      }
   
       private void addNode (TreeNode addHere, TreeNode nodeToAdd)
      {
         if (addHere.getVal() == nodeToAdd.getVal())
            return;
      
         if (nodeToAdd.getVal() > addHere.getVal())
         {
            if (addHere.right == null)
               addHere.right = nodeToAdd;
            else
               addNode(addHere.right, nodeToAdd);
         }
         else
         {
            if (addHere.left == null)
               addHere.left = nodeToAdd;
            else
               addNode(addHere.left, nodeToAdd);
         }
      }
   	
       public void print()
      {
         head.print();
      }
		
		public void findElement(int element)
		{
		
		}
   
   }