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

template

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

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

$//$ Postcondition: The original left subtree has been moved and is now the right

$//$ subtree, and the original right subtree is now the left subtree.

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

$//11$

$///\backslash /\backslash$

$//2332$

$///\backslash /\backslash$

$//4545$