struct node{
int number;
int data;
struct node right;
struct node left;
}
typedef struct node nod;
typedef struct node* nodePtr;
typedef struct node** nodePtrPtr;
 int main(){
 nodePtr a;

calAverage(&a);
 }
 void calAverage(nodePtrPtr tree){
 {
   nodePtr g;
   double average, sum=0,num,n,s=0;
   int k,z=0;
int l,w=0;
g=(*tree);
while( g != NULL){
    k=g->number;
    num=g->data;
    sum+=(num*k );
    z+=k;
    g=g->right;
    while( g != NULL){
    l=g->number;
    n=g->data;
    s+=(n*l);
    w+=l;
    g= g->left;
    }
}
average=((sum+s)/(z+w));
printf("%.1lf average ",average);}