OJ—二叉树深度、宽度计算

题目：给定一个二叉树，获取该二叉树的宽度深度。
代码：

#include "OJ.h"
#include <string.h>
#include <stdio.h>

/*
Description
         给定一个二叉树，获取该二叉树的宽度深度。
Prototype
         int GetBiNodeInfo(BiNode &head, unsigned int *pulWidth, unsigned int *pulHeight)
Input Param
         head   需要获取深度的二叉树头结点
Output Param
         pulWidth   宽度
         pulHeight  高度
Return Value
         0          成功
         1          失败或其他异常
*/

int TreeDepth(BiNode* pTop)
{
    if (pTop == NULL)
    {
        return 0;
    }
    else
    {
        int left = TreeDepth(pTop->left);
        int right = TreeDepth(pTop->right);
        return (left>right? left+1:right+1);
    }
}

void bt_level_num(BiNode* tree, int a[], int h) {
    if (tree == NULL)
    {
        h = 0;
    }
    else
    {
        a[h] += 1;
        bt_level_num(tree->left, a, h + 1);
        bt_level_num(tree->right, a, h + 1);
    }
}

int bt_width(BiNode* tree) {
    int a[N]={0}, h = 0, max=0, i;

    bt_level_num(tree, a, h);

    for (i = 0; i < N; i++)
    {
        if (a[i] > max)
        {
            max = a[i];
        }
    }
    return max;
}


int GetBiNodeInfo(BiNode &head, unsigned int *pulWidth, unsigned int *pulHeight)
{
    /*在这里实现功能*/
    BiNode* pTop = &head;
    if (pTop == NULL)
    {
        *pulWidth = 0;
        *pulHeight = 0;
        return -1;
    }

    unsigned int depth = TreeDepth(pTop);
    *pulHeight = depth;

    unsigned int wd = bt_width(pTop);
    *pulWidth = wd;
    return 0;
}