Binary search trees with no duplicate entries have all leaves on the the second level.
There are no hints for this question.