UVA Binary Search Tree(BST+计数问题)

一颗BST的种类由C(sumson，lson)得出，那么每颗子树的合并都用乘法合并，跑下dfs就行。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn=25,mod=9999991;
struct Node{
    Node *left,*right;
    int v,count;
    LL dp;
    
    int lcnt(){
        if(left!=NULL) return left->count;
        else return 0;
    }
    
    int rcnt(){
        if(right!=NULL) return right->count;
        return 0;
    }
};
Node *root,node[maxn];
int sz;
Node* newNode(int v)
{
    Node *p=&(node[sz++]);
    p->v=v;
    p->dp=1;
    p->count=1;
    return p;
}
void insert(int x)
{
    if(!root){
        root=newNode(x);
        return ;
    }
    Node *cur=root;
    while(cur!=NULL)
    {
        if(x<cur->v){
            if(cur->left==NULL) {cur->left=newNode(x);return ;}
            else cur=cur->left;
        }
        else{
            if(cur->right==NULL) {cur->right=newNode(x);return ;}
            else cur=cur->right;
        }
    }
}
LL c[maxn][maxn];
void C()
{
    c[0][0]=1;
    for(int i=1;i<maxn;i++)
        for(int j=0;j<=i;j++)
            c[i][j]=(j==0)?c[i-1][j]:(c[i-1][j-1]+c[i-1][j])%mod;
}
void dfs(Node *cur)
{
    if(!cur->left&&!cur->right) return ;
    if(cur->left) dfs(cur->left);
    if(cur->right) dfs(cur->right);
    
    cur->count=cur->lcnt()+cur->rcnt()+1;
    if(cur->left&&cur->right){
        LL cc=c[cur->count-1][cur->lcnt()];
        cur->dp=(cc*cur->left->dp*cur->right->dp)%mod;
    }
    else if(cur->right){
        cur->dp=cur->right->dp;
    }
    else{
        cur->dp=cur->left->dp;
    }
}
void solve()
{
    sz=0;
    root=NULL;
    memset(node,0,sizeof(node));
    int n,x;scanf("%d",&n);
    for(int i=0;i<n;i++) {
        scanf("%d",&x);
        insert(x);
    }
    dfs(root);
    printf("%lld\n",root->dp);
}
int main()
{
    C();
    int t;scanf("%d",&t);
    while(t--){
        solve();
    }
}