Q$3)$ Write a member function for the binaryTreeType class $($given in Q$3.$h$)$ that

calculates and compares the sum of the nodes in the left and right subtrees. If the sum of

the nodes in the left subtree is greater, return $1$; if the sum of the nodes in the right

subtree is greater, return $2$ ; if the sums are equal, return $0.$ If the binary tree is empty,

return $-1.$

int binaryTreeTypeWrite a non$-$member function that tests whether a given stack s $($of type stackType$)$ is symmetric with respect to its middle point. The function should return true if the stack is symmetric; otherwise it should return false. The original stack should be preserved after the operation. You should use the basic stack operations $($isEmptyStack$,$ top, pop, push$)$ in your solution. Feel free the use auxiliary stack$($s$)$ whenever you need to$.($As an example, the function should return true for the stacks $[$a b c c b a and $[12321$; but it should return false for $[$a b c b and $[123431.$ Empty stacks should be considered as symmetric$).$ bool testSymmetry$($ &s$)$