DS树--带权路径和

#include<iostream>
#include<string>
using namespace std;
class BitreeNode
{
public:
    char data;
    int weight;
    int height;
    BitreeNode *left;
    BitreeNode *right;
    BitreeNode()
    {
        weight=0;
        height=0;
        left=NULL;
        right=NULL;
    }
};
 
class Bitree
{
public:
    BitreeNode *Root;
    int pos,index;///index控制数组非0权值
    string strtree;
    int API;
    Bitree(int *w,string str)
    {
        pos=index=0;
        API=0;
        strtree=str;
        Root=CreateBitree(w,0);///根结点无双亲，双亲高度为0
    }
    BitreeNode *CreateBitree(int *w,int fatherheight)
    {
        char ch=strtree[pos];
        pos++;
        if(ch==‘0‘)
        {
            return NULL;
        }
        else
        {
            BitreeNode *T=new BitreeNode();
            T->data=ch;
            T->height=fatherheight+1;
            if(T->data>=‘A‘&&T->data<=‘Z‘)
            {
                T->weight=w[index];
                index++;
            }
            T->left=CreateBitree(w,T->height);
            T->right=CreateBitree(w,T->height);
            return T;
        }
    }
    void preorder(BitreeNode *T)
    {
        if(T!=NULL)
        {
            API+=T->weight*(T->height-1);///高度减1才是对应乘的值
            preorder(T->left);
            preorder(T->right);
        }
        return;
    }
};
 
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        string str;
        cin>>str;
        int n;
        cin>>n;
        int *a=new int[n];
        for(int i=0;i<n;i++)
            cin>>a[i];
        Bitree Tree(a,str);
        Tree.preorder(Tree.Root);
        cout<<Tree.API<<endl;
    }
    return 0;
}