Find a value within a binary search tree

FindInBST.java

public class FindInBST {

    public static Node<T> findValueInBST(T value, Node<T> root) {
        checkNotNull(value);
                
        //terminating condition
        if (root == null) {
            return null;
        }
        
        if(value.compareTo(root.value) == 0) {
            return root;
        } else if(value.compareTo(root.value) > 0) {
            return findValueInBST(value, root.leftChild);
        } else {
            return findValueInBST(value, root.rightChild);
        }
    }
}

Node.java

private class Node <T implements Comparable> {
    T value;
    Node<T> leftChild;
    Node<T> rightChild;
}