Question 3. This question is about Binary Search Trees and A. Recall that a binary search tree node is declared as follows: public class BSTNode public int key public BSTNode left; public BSTNode right 1. Write a method that given a reference to the root of a binary search tree, print all of the even numbers in sorted order. public static void printEvenSorted (BSTNode root) { 2. Write a method that given a reference to the root of a binary search tree and a particular key, returns a reference to the node that contains that key or null if the key is not found. public static BSTNode search(BSTNode root, int key){ Show transcribed image text Question 3. This question is about Binary Search Trees and A. Recall that a binary search tree node is declared as follows: public class BSTNode public int key public BSTNode left; public BSTNode right 1. Write a method that given a reference to the root of a binary search tree, print all of the even numbers in sorted order. public static void printEvenSorted (BSTNode root) { 2. Write a method that given a reference to the root of a binary search tree and a particular key, returns a reference to the node that contains that key or null if the key is not found. public static BSTNode search(BSTNode root, int key){

## Expert Answer

Answer to Question 3. This question is about Binary Search Trees and A. Recall that a binary search tree node is declared as follo…