Binary Tree search and print methods

Question

Hello, I'm trying to create a binary tree from inputs of a user. I believe I have the tree set up right because it shows no errors, but I'm getting an error message with a line of code. I cannot figure out what I am doing wrong. Also, I need to create a print method, which prints the tree's entries and a search method which would search the tree for certain record.
public class TreeNode 
      public static String empName = null;
      public static int empNumber;
      public static String nextRec = null;
          TreeNode left;
      String Name;
      int Number;
      TreeNode right;
      public static void main(String[] args)
         VRead in = new VRead();
         VWrite out = new VWrite();
         System.out.println("Enter Choice: ");
         System.out.println("A: Enter Employee Information.");
         System.out.println("B: Search For Employee.");
         System.out.println("C: Print Entire Tree.");
         System.out.println("D: Exit.");
         System.out.println("_______________________________");
         char command = in.readChar();
         System.out.println();
         switch (command)
            case 'A':
            case 'a':
               inputInfo(in, out);           
               break;
            case 'B':
            case 'b':
               break;
            case 'C':
            case 'c':
               break;
            case 'D':
            case 'd':
               System.exit(0);
               break;
      public static void inputInfo(VRead in, VWrite out)
         out.write("Enter Employee Name: ");
         empName = in.readString();
         out.write("Enter Employee Number: ");
         empNumber = in.readInt();
         System.out.println();
         System.out.println();
         System.out.println("Enter Choice: ");
         System.out.println("A: Enter Employee Information.");
         System.out.println("B: Search For Employee.");
         System.out.println("C: Print Entire Tree.");
         System.out.println("D: Exit.");
         System.out.println("_______________________________");
         char command = in.readChar();
         System.out.println();
         switch (command)
            case 'A':
            case 'a':
               inputInfo(in, out);           
               break;
            case 'B':
            case 'b':
               break;
            case 'C':
            case 'c':
                         break;
            case 'D':
            case 'd':
               System.exit(0);
               break;
      public TreeNode(String empName, int empNumber)
         Name = empName;
         Number = empNumber;
         left = null;
         right = null;
      public class Tree
         TreeNode Root;
         public void Tree(String RootNode)   
    // Errors come from next line
              Root = new TreeNode(RootNode, Name, Number);   
         public void Insert(String Name, int Number)
            InsertNode(Root, Name, Number);
         public void InsertNode(TreeNode t, String empName, int empNumber)
            if (t == null)
               t = new TreeNode(empName, empNumber);
            else
               if (empName.compareTo(t.Name) < 0)
                  InsertNode(t.left, empName, empNumber);
               else if (empName.compareTo(t.Name) > 0)
                  InsertNode(t.right, empName, empNumber);
               else if (empName.compareTo(t.Name) == 0)
                  System.out.println("Entered node that was already in Tree");
   }im sure its something simple, i seem to always look over the small stuff. But i could really use some help on the print and search method too

Answer 1

Just having a quick look over it, and it looks like you are trying to add an extra argument in the TreeNode() method (unless there is a bit of overloading and there is a second treenode method in there) As it is TreeNode only accepts two argumets you have 3
As for printing the tree you would need to flatten it, that is an in order traversal of the tree.
FWIW
I just finished a project at uni that involved at frist writing a BST and then an AVL tree. the full point of these things seems to be to keep students awake at night*
*Before anyone flames, it's a joke
G