Write a new class, PokemonMain, with a main method that:

a$.$ Creates a binary tree with your favorite Pok$$mon at the root and a new PokemonComparator.

b$.$ Insert at least $10-15$ more Pok$$mon in any order.

c$.$ Use your StringVisitor to stringify the binary tree and print the string. They should print in reverse order by number $($from largest to smallest$).$

The Comparable interface is implemented by a class that needs to define its own natural order. It is called on one instance of the class to compare itself to another instance of the same class, e$.$g$.$ A$.$ compareTo$($B$).$ It works the same way that Comparable does:

a$.$ It returns an integer $<mtext></mtext><mn>0</mn>$ if A comes before $B$ in order, i$.$e$.$ ABA$==B>B{B}^{\text{'}}AA$

$b.It$ returns $0if$ A and $B$ are equivalent, $i.e.A==B$

$c.It$ returns $an$ integer $>0if$ A comes after $Bin$ order, $i.e.A>B$

Update your Pok$mon$ class $to$ implement Comparable $so$ that the Pok$mon$ are arranged $in$ order $by$ number $(from$ smallest $to$ largest$).$ For example, $if$ Pokemon $A\text{'}s$ number $if25$ and $B^{\text{'}}s$ number $is50,A.$ compareTo$(B)$ would return a number $<mtext></mtext><mn>0</mn>$ because A should come first.