They give me the following problem that I can not reach.
Implement a method that gives as parameters a binary search tree and
returns the largest immediate value.
That is, given the following tree:
The immediate value of May 3 would be 8
The immediate value greater than 14 could return -1 because it does not have
The immediate value greater than 4 it would be 6.
NOTE: The solution must be implemented in Java.