树宽度

void FindWidth(BiTree*root, int k)
{
    
    if(root==NULL)
    {
        heigh=k;
        return;
    }
      
    count[k]++;
    
    if(MAX<count[k]) MAX=count[k];
    
    FindWidth(root->lchild,k+1);
    FindWidth(root->rchild,k+1);
}