计算二叉树最大宽度（C语言代码）

#define MAX_SIZE 50
typedef struct TreeNode {
    int val;
    struct TreeNode* left;
    struct TreeNode* right;
} TreeNode;

// 创建一个新节点  
TreeNode* createNode(int val) {
    TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));
    newNode->val = val;

    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
}
int levelOrderTraversal(TreeNode* root, int* num)
{
    if (root == NULL)
    {
        return 0;
    }
    TreeNode** queue = (TreeNode**)malloc(sizeof(TreeNode*)*100);
    int front = 0, rear = 0;
    //将根节点入队
    queue[rear++] = root;
    while (front < rear)
    {
        TreeNode* current = queue[front++];
        int leftChild = (current->left != NULL) ? 1 : 0;
        int rightChild = (current->right != NULL) ? 1 : 0;
        if (leftChild + rightChild == 1)
        {
            (*num)++;
        }
        if (current->left != NULL)
        {
            queue[rear++] = current->left;
        }
        if (current->right !=NULL)
        {
            queue[rear++] = current->right;
        }
    }
    free(queue);
    return 0;
}
void LeveWidth(TreeNode* root, int a[], int h)
{
    if (root!=NULL)
    {
        a[h] = a[h] + 1;//a[1] = a[1] +1 = 0+1;
        LeveWidth(root->left, a, h + 1);
        LeveWidth(root->right, a, h + 1);
    }
}
int Widht(TreeNode* root)
{
    int a[MAX_SIZE] = { 0 }, h = 1;
    LeveWidth(root, a, h);
    int wid = a[0];//wid = 0;
    for (int i = 1; i <= MAX_SIZE; i++)
    {
        if (a[i] > wid)
        {
            wid = a[i];
        }

    }
    return wid;
}
int main()
{
    TreeNode* root = createNode(1);
    root->left = createNode(2);
    root->right = createNode(3);
    root->left->left = createNode(4);
    root->left->right = createNode(5);
    root->right->left = createNode(6);
    root->right->right = createNode(7);
    int wid = Widht(root);
    printf("最大宽度为%d", wid);
    return 0;
}