Exercise 1:

The target of this exercise is to manage binary tree data structures.

We will create a class, called MouseTree, to represent mouse binary trees, with the same information used in the laboratory session 9 exercises. Each tree node will represent a mouse, and will have two links, one for its father and other for its mother.

Create the class MouseTree following these requisites;

Write a main method to test this class.