二叉链表用按层次遍历二叉树的方法，统计树中度为1的结点数目

Just Follow JJ_Lin

于 2024-10-13 16:19:44 发布

阅读量151

点赞数 3

文章标签：链表数据结构

本文链接：https://blog.csdn.net/2305_78057683/article/details/142900014

版权

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;
}
int main()
{
    TreeNode* root = createNode(1);
    root->left = createNode(2);
    root->right = createNode(3);
    root->left->right = createNode(4);
    root->right->left = createNode(5);
    int num = 0;
    levelOrderTraversal(root, &num);
    printf("度为1的节点个数为%d", num);
    return 0;
}