binary search tree implementation in java hindi

 binary search tree implementation in java hindi

public class binarysearch {
    class Node{
        int data;
        Node left;
        Node right;
        Node(int data){
            this.data=data;
            this.left=null;
            this.right=null;
        }
    }
    public Node addtress(Node root,int values){
        if (root==null){
            return new Node(values);
        }
        if (values< root.data){
            root.left=addtress(root.left,values);
        }
        else{
            root.right=addtress(root.right,values);
        }
        return root;
    }
    public void inorder(Node root){
        if (root==null) return;
        inorder(root.left);
        System.out.print(root.data + " ");
        inorder(root.right);
    }
    public static void main(String[] args) {
        binarysearch bss=new binarysearch();
        Node root=null;
        root=bss.addtress(root,10);
        root=bss.addtress(root,200);
        root=bss.addtress(root,30);
        root=bss.addtress(root,40);
        root=bss.addtress(root,50);
        root=bss.addtress(root,80);
        root=bss.addtress(root,90);
        bss.inorder(root);
    }
}