In this assessment we are addressing topics covered in chapter $11$ of Open Data Structures in Java and chapter $3$ in Algorithms. There are two questions, each worth a single point. To receive full credit you must address each question in the entirety. Answers that do not fully address each question are not necessarily awarded full credit.

Question at position $1$

$1$

$1$ point

Question at position $1$

Prove that a binary tree with k leaves has height at least log k$.($p $245)$ Open Data Structures in Java, section $11\mathrm{.}3$