template Using the binary$\_$tree$\_$node from Section $10\mathrm{.}3,$ write a recursive function to meet the following specification. Check as much of the precondition as possible.

template

void flip$($binary$\_$tree$\_$node$*$ root$\_$ptr$)$

$//$ Precondition: root$\_$ptr is the root pointer of a non$-$empty binary tree.

$//$ Postcondition: The tree is now the mirror image of its original value.

$//$ Example original tree: Example new tree:

$//11$

$///\backslash /\backslash$

$//2332$

$///\backslash /\backslash$

$//4554$