Give the node representation in a binary tree declared as follows:

typedef struct node $*$treePointer;

typedef struct node $\{$

int data;

treePointer left$\_$child, right$\_$child;

$\}$;

Write a recursive function to get a summation of data values of all nodes, whose argument is the pointer

to root.