二叉树——求WPL

//
求WPL

// An highlighted block
#include<stdio.h>
#include<stdlib.h>
struct Node{
    int weight;
    Node *left;
    Node *right;
};
/*
创建树
*/
Node *CreateTree(){
    Node *root = NULL;
    int ch;
    scanf("%d",&ch);
    if(ch!=-1){
        root = (Node *)malloc(sizeof(Node));
        root->weight = ch;
        root->left = CreateTree();
        root->right = CreateTree();        
    }
    return root;
    
}
///求WPL
int GetWPL(Node *root,int deep){
    if(root->left==NULL&&root->right==NULL)
        return root->weight*deep;
    return GetWPL(root->left,deep+1)+GetWPL(root->right,deep+1);
}

int main(){
    Node *root;
    root = CreateTree();
    printf("WPL: %d\n",GetWPL(root,0));
    system("pause");
    return 0;
}

/*
数据集：（前缀创建二叉树）
5
1
1
-1
-1
4
-1
-1
2
3
-1
-1
6
-1
-1


WPL=28
*/