Create a public class BinaryTreeCounter that provides a single class method named countEqualChildren that accepts a single BinaryTree<?> and counts the number of nodes in the tree that have two children with equal values. Keep in mind that not every node has a right or left child, so you'll need to check for null carefully. (Or use try-catch!) However, you can assume that all the values in the tree are non-null.

For reference, cs125.trees.BinaryTree has the following public properties: