Referring to the BST and BSTNode classes for binary search trees as done in class: Determine the result of executing root. whatever( ) given that whatever is an instance method of BSTNode as defined below, that A is an array of integers with the same number of elements as the tree, i is zero, and given the binary search tree that would result from inserting the following items in the order in which they are presented: 25, 12, 40, 28, 20, 15, 37, 17, 62
public void whatever() {
if (right != null) right. whatever(); if (left != null) left. whatever(); A[i++] = value;
}