@@ -0,0 +1,1259 @@
+import java.util.*;%0Aimport java.io.*;%0Aclass Node%7B%0A    Node left,right;%0A    int data;%0A    Node(int data)%7B%0A        this.data=data;%0A        left=right=null;%0A    %7D%0A%7D%0Aclass Solution%7B%0A%0A    public static int getHeight(Node root)%7B%0A        if (root == null) return -1;%0A        int _left  = getHeight(root.left);%0A        int _right = getHeight(root.right);%0A        if (_left %3E _right) %7B%0A            return(_left+1); %0A        %7D else %7B%0A            return(_right+1);%0A        %7D%0A    %7D%0A%0A%09public static Node insert(Node root,int data)%7B%0A        if(root==null)%7B%0A            return new Node(data);%0A        %7D%0A        else%7B%0A            Node cur;%0A            if(data%3C=root.data)%7B%0A                cur=insert(root.left,data);%0A                root.left=cur;%0A            %7D%0A            else%7B%0A                cur=insert(root.right,data);%0A                root.right=cur;%0A            %7D%0A            return root;%0A        %7D%0A    %7D%0A    public static void main(String args%5B%5D)%7B%0A            Scanner sc=new Scanner(System.in);%0A            int T=sc.nextInt();%0A            Node root=null;%0A            while(T--%3E0)%7B%0A                int data=sc.nextInt();%0A                root=insert(root,data);%0A            %7D%0A            int height=getHeight(root);%0A            System.out.println(height);%0A        %7D%09%0A%7D%0A

Create Day_22_Binary_Search_Trees.java