나무의 높이와 너비 구하기 | 나무

// 
int getTreeHigh(BiTree Tree)
{
    int LeftTreeHigh = 0,RightTreeHigh = 0;

    if (Tree==NULL)
    {
        return 0;
    }

    LeftTreeHigh = getTreeHigh(Tree->lchild)+1;
    RightTreeHigh = getTreeHigh(Tree->rchild)+1;

    return getMax(LeftTreeHigh,RightTreeHigh);
}

// 
int getTreeLeastHigh(BiTree Tree)
{
    int LeftTreeHigh = 0,RightTreeHigh = 0;

    if (Tree==NULL)
    {
        return 0;
    }

    
    LeftTreeHigh = getTreeLeastHigh(Tree->lchild)+1;

    RightTreeHigh = getTreeLeastHigh(Tree->rchild)+1;

    return getMin(LeftTreeHigh,RightTreeHigh);
}

// 
static int MaxDepth = 0;
void getTreeHigh3(BiTree Tree,int Depth=0)
{
    if (Tree!=NULL)
    {
        // 
        if ((Tree->lchild==NULL)&&(Tree->rchild==NULL))
        {
            if (MaxDepthlchild,Depth+1);
        getTreeHigh3(Tree->rchild,Depth+1);
    }
}

// 
int getTreeHigh2(BiTree Tree)
{
    if(Tree==NULL)
    {
        return 0;
    }
    Queue MyQueue(100);
    BiNode *p=Tree;
    

    // 、 、 
    int High = 0,NodesLeft = 1,NodesCnt = 0;

    //printf(" 0：");
    do
    {
        //printf("%d ",p->data);

        if (p->lchild!=NULL)
        {
            NodesCnt++;
            MyQueue.EnQueue(p->lchild);
        }

        if (p->rchild!=NULL)
        {
            NodesCnt++;
            MyQueue.EnQueue(p->rchild);
        }

        NodesLeft--;
        if (NodesLeft==0)
        {
            // 
            NodesLeft = NodesCnt;
            NodesCnt = 0;
            High++;
        }
    }
    while(MyQueue.DeQueue(&p));

    return High-1;
}

// ， 0， 
// ， ， ， 。
template 
void getTreeLevelWidth(T Tree,int ObjectDepth,int *WidthCnt,int CurDepth=0)
{
    if (Tree==NULL||CurDepth>ObjectDepth)
    {
        return;
    }
    else if(CurDepthlchild,ObjectDepth,WidthCnt,CurDepth+1);
        getTreeLevelWidth(Tree->rchild,ObjectDepth,WidthCnt,CurDepth+1);
    }
    else
    {
        (*WidthCnt)++;
    }
}

template 
int getTreeMaxWidth(T Tree,int TreeHigh)
{
    int MaxWidth=0,CurWidth=0;

    for (int i = 0;i=MaxWidth)
        {
            MaxWidth = CurWidth;
        }
    }

    return MaxWidth;
}