height.java

import java.util.*;
class bst{
  class node{
    int data;
    node left,right;
     node(int data)
       {
         this.data=data;
         left=right=null;
       }
  }
  node root;
 bst(){
   root=null;
 }
 void insert(int data){
   root=insertv(root,data);
 }
  node insertv(node root,int data)
    {
       if(root==null)
            return new node(data);
            else if(data<root.data)
              root.left=insertv(root.left,data);
               else if(data>root.data)
                 root.right=insertv(root.right,data);
                return root;
   }
   void preordr()
     {
      // System.out.println("pre order===");
          preorder(root);
     }
     void preorder(node t)
      {
        if(t!=null)
         {

           preorder(t.left);
            System.out.print(t.data+" ");
           preorder(t.right);
         }
      }

     void height(){
       System.out.println("height of tree "+heightf(root));
     }
     int heightf(node root)
      {
        if(root==null)
           return 0;
           else
            {
              int lh=heightf(root.left);
              int rh=heightf(root.right);
              if(lh>rh)
                 return lh+1;
                 else
                  return rh+1;
            }
      }

public static Scanner sc=new Scanner(System.in);
public static void main(String[] e){
bst bt=new bst();

   while(true){
     int x=sc.nextInt();
     if(x==-1)
        break;
        bt.insert(x);
   }
  System.out.print("IN_ORDER : ");
  System.out.println();
  bt.preordr();
   bt.height();

}
}