Suppose numbers is a variable of class BinarySearchTree and value is a variable of

type int. Write a Java statement that prints true if value is inbetween the largest and smallest

values stored in numbers, and false otherwise.

Question $14(2$ points$)$

Draw the binary search tree that results from starting with an empty tree and adding $507296$

$9426121192102551161795$

Question $15(4$ points$)$

Draw the binary search tree that results from starting with an empty tree and adding $507296$

$942612119210,$ then removing $12$ and $72$

Question $16(3$ points$)$

Question $17(2$ points$)$