Create a public class BinaryTreeCounter that provides a single class method named countEqualToEitherChild that accepts a single BinaryTree and counts the number of nodes in the tree where the value at that node is equal to either the value at its right child or the value at its left child. 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 of the values in the tree are non-null.

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