求树的带权路径长度

typedef struct BNode{
	ElemType elem;
	int weight;
	struct BNode *left, *right;
} BNode, *BTree;

int WPL(Btree T, int level){
	if(T==NULL){
		return 0;
	}
	if(T->left==NULL&&T->right==NULL){
		return T.weight*level;
	}
	
	else{
		return WPL(T->left, level+1) + WPL(T->right, level+1);
	}
}

T_wpl = WPL(T,0);