---

DFS,将递归层数*叶结点权值

typedef struct Node

{

int weight;

Node *left;

Node *right;

void WPL(int &result, Node *n, int num) // 结果 指针 递归次数
{
if(n->left == NULL && n->right == NULL) result += n->weight * num;
if(n->left != NULL) WPL(result,n->left,num+1);
if(n->right != NULL) WPL(result,n->right,num+1);
return;
}

int getWPL()
{
int *result = 0;
WPL(result,n,0);
return result;
}

}