template

auto BinaryNodeTree::balancedAdd$($std::shared$\_$ptr$>$ subTreePtr, std::shared$\_$ptr$>$ newNodePtr$)\{$

if $($subTreePtr $==$ nullptr$)$ return newNodePtr;

else

$\{$

auto leftPtr $=$ subTreePtr$->$getLeftChildPtr$()$; auto rightPtr $=$ subTreePtr$->$getRightChildPtr$()$;

if $($getHeightHelper$($leftPtr$)>$ getHeightHelper$($rightPtr$))\{$

rightPtr $=$ balancedAdd$($rightPtr $,$ newNodePtr$)$;

subTreePtr$->$setRightChildPtr$($rightPtr $)$;

$\}$

else

$\{$

leftPtr $=$ balancedAdd$($leftPtr$,$ newNodePtr$)$;

subTreePtr$->$setLeftChildPtr$($leftPtr$)$;

$\}$

return subTreePtr; $\}$

$\}$ If you change the $>($smaller than$)$ sign with $<($greater than$)$ sign in line $11,$ does it make any difference? Yes or no$,$ explain your answer in any case.

After changing the stated sign in line $11,$ create a new binary tree by adding the numbers; $80-70-60-50-40-30-20-10$ respectively. Show the tree step by step and draw it after adding each number to it$.$