Binary Search Trees:Search Node in BST

public class Solution {

    /*	Binary Tree Node class
 * 
 * class BinaryTreeNode<T> {
		T data;
		BinaryTreeNode<T> left;
		BinaryTreeNode<T> right;

		public BinaryTreeNode(T data) {
			this.data = data;
		}
	}
	*/

    public static BinaryTreeNode<Integer> searchInBST(BinaryTreeNode<Integer> root , int k){
        if(root==null)
            return null;
        BinaryTreeNode<Integer> ans;
        if(root.data==k)
            return root;
        
            else if(k>root.data)
                ans=searchInBST(root.right,k);
        else
            ans=searchInBST(root.left,k);
        return ans;

    }
}