Exercise#$2$: Tree Questions

Questions:

$1.)$ Prove that the maximum number of nodes a binary tree of height h can have is $2$h $1$ using induction. $2.)$ What is the minimum height of a binary search tree with n nodes?

$3.)$ Refer to Exercise$1$ and implement the function public int getHeight$()$: This method should return the height of the binary search tree.