Binary Tree Insert and Search operations

class BinTree
    {
        public BinTree left;
        public BinTree right;
        public int data;
    }

  static BinTree root;
      public static void InSertNode(int x)
        {
            BinTree temp;
            BinTree temp1;
            BinTree curNode = new BinTree();
            curNode.data = x;
            if (root == null)
            {
                root = curNode;
            }
            else
            {
               temp1 = temp = root;

               while (temp1 != null)
               {
                   if (curNode.data > temp.data && temp.right != null)
                   {
                       temp = temp.right;
                   }
                   else if (curNode.data < temp.data && temp.left != null)
                   {
                       temp = temp.left;
                   }
                   else
                       temp1 = null;
               }

                if (curNode.data > temp.data)
                    temp.right = curNode;
                else
                    temp.left = curNode;
            } 
        }

 public static void PreOrder(BinTree root)
        {
            if (root!= null)
            {
                Console.WriteLine(root.data);
                PreOrder(root.left);               
                PreOrder(root.right);               
            }
        }

 public static void InOrder(BinTree root)
        {
            if (root!= null)
            {
                PreOrder(root.left);   
                Console.WriteLine(root.data);            
                PreOrder(root.right);               
            }
        }

 public static void InOrder(BinTree root)
        {
            if (root!= null)
            {
                PreOrder(root.left);   
                PreOrder(root.right);   
                Console.WriteLine(root.data);   
            }
        }