Write the code needed that adds up all the nodes in a binary tree whose left and right child contain identical values. The function prototype can be seen below: int twins(binTreeNoder): Assume binTreeNode is a struct defined that contains an integer data and two pointers (one that points to the left child and the other to the right child). Assume the root pointer is passed into the function when first called