Question 3: This question is about Binary Search Trees and A. Recall that a binary search tree node is declared as follows: ublic USTNode right: 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) { 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: ublic USTNode right: 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) {

## 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…