Create a public class called YourBinaryTree that extends BinaryTree. Override protected int countLessThan$($Comparable value$)$ and return the number of nodes in the tree that contain values that the passed value is strictly less than. If value is null you should throw an IllegalArgumentException. A portion of the BinaryTree class that you are extending is shown below for reference. Note that all Comparables added to each tree will be the same type.

As a reminder, first.compareTo$($second$)$ returns a positive value if first is larger than second, a negative value if first is smaller than second, and $0$ if they are equal.