Question

Q4 Programming 10 Points public class BSTNode<t extends Comparable<T>> { public T data; public BSTNode<T> left, right; public BSTNode (T data, BSTNode<T> left, BSTNode<T> right) { this.data = data; this.left = left; this.right - right; In this section, you will write a method that checks the validity of a BST. You can avoid requiring such additional memory but directly using the definition of BST. Specifically, you can pass the minimum and maximum values down to the recursive calls to help you track the allowed range of values to the children nodes. Alternatively, you can have the recursive method return the minimum and maximum values of each subtree, and use those values to track the allowed range of values of the parent node. For this question, you are allowed to create a new method such as recursive helper methods. Remember, since this is a generic class, you CANNOT use < or >, instead, you must use the compareTo method. public boolean isValid (BSTNode<T> node) { Enter your answer here

Answer 1

Answer:

public boolean isValid(BSTNode<T> node) {
    if (node == null) {
        return true;
    } else {
        return ((node.left == null || node.data.compareTo(node.left.data) > 0) && isValid(node.left)) &&
                ((node.right == null || node.data.compareTo(node.right.data) < 0) && isValid(node.right));
    }
}