完全二叉树的高度C语言

完全二叉树的高度可以通过递归的方式来计算。下面是一个用C语言实现的计算完全二叉树高度的函数：

typedef struct tree_t {
    tree_datatype data; // 数据域
    struct tree_t *lchild; // 指向左子树的结构体指针
    struct tree_t *rchild; // 指向右子树的结构体指针
} bitree_t;

int getHeight(bitree_t *root) {
    if (root == NULL) {
        return 0;
    } else {
        int leftHeight = getHeight(root->lchild);
        int rightHeight = getHeight(root->rchild);
        return (leftHeight > rightHeight) ? (leftHeight + 1) : (rightHeight + 1);
    }
}

在上面的代码中，`getHeight`函数使用递归的方式计算完全二叉树的高度。如果根节点为空，则返回0；否则，分别计算左子树和右子树的高度，并返回较大的那个高度加1。

相关问题

完全二叉树判断c语言

以下是判断完全二叉树的C语言代码：

#include <stdio.h>
#include <stdbool.h>

#define MAX_SIZE 100

// 定义二叉树结点
typedef struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
} TreeNode;

// 判断是否为完全二叉树
bool isCompleteTree(TreeNode* root) {
    if (!root) {
        return true;
    }
    // 定义队列
    TreeNode* queue[MAX_SIZE];
    int front = 0, rear = 0;
    queue[rear++] = root;
    bool flag = false; // 标记是否出现过空结点
    while (front < rear) {
        TreeNode* node = queue[front++];
        if (!node->left) {
            flag = true;
        } else if (flag) {
            return false;
        } else {
            queue[rear++] = node->left;
        }
        if (!node->right) {
            flag = true;
        } else if (flag) {
            return false;
        } else {
            queue[rear++] = node->right;
        }
    }
    return true;
}

int main() {
    // 构造一棵完全二叉树
    TreeNode node1 = {1, NULL, NULL};
    TreeNode node2 = {2, NULL, NULL};
    TreeNode node3 = {3, NULL, NULL};
    TreeNode node4 = {4, NULL, NULL};
    TreeNode node5 = {5, NULL, NULL};
    TreeNode node6 = {6, NULL, NULL};
    TreeNode node7 = {7, NULL, NULL};
    node1.left = &node2;
    node1.right = &node3;
    node2.left = &node4;
    node2.right = &node5;
    node3.left = &node6;
    node3.right = &node7;

    if (isCompleteTree(&node1)) {
        printf("This is a complete binary tree.\n");
    } else {
        printf("This is not a complete binary tree.\n");
    }

    return 0;
}

创建完全二叉树C语言

以下是创建完全二叉树的C语言代码示例：

#include <stdio.h>
#include <stdlib.h>

#define MAX_SIZE 100

typedef struct TreeNode {
    int data;
    struct TreeNode *left;    struct TreeNode *right;
} TreeNode;

typedef struct Queue {
    TreeNode *data[MAX_SIZE];
    int front, rear;
} Queue;

Queue *createQueue() {
    Queue *queue = (Queue *)malloc(sizeof(Queue));
    queue->front = queue->rear = 0;
    return queue;
}

void enqueue(Queue *queue, TreeNode *node) {
    if ((queue->rear + 1) % MAX_SIZE == queue->front) {
        printf("Queue is full.\n");
        return;
    }
    queue->data[queue->rear] = node;
    queue->rear = (queue->rear + 1) % MAX_SIZE;
}

TreeNode *dequeue(Queue *queue) {
    if (queue->front == queue->rear) {
        printf("Queue is empty.\n");
        return NULL;
    }
    TreeNode *node = queue->data[queue->front];
    queue->front = (queue->front + 1) % MAX_SIZE;
    return node;
}

TreeNode *createTree(int arr[], int size, int index) {
    if (index >= size) {
        return NULL;
    }
    TreeNode *node = (TreeNode *)malloc(sizeof(TreeNode));
    node->data = arr[index];
    node->left = createTree(arr, size, 2 * index + 1);
    node->right = createTree(arr, size, 2 * index + 2);
    return node;
}

void levelOrderTraversal(TreeNode *root) {
    if (root == NULL) {
        return;
    }
    Queue *queue = createQueue();
    enqueue(queue, root);
    while (queue->front != queue->rear) {
        TreeNode *node = dequeue(queue);
        printf("%d ", node->data);
        if (node->left != NULL) {
            enqueue(queue, node->left);
        }
        if (node->right != NULL) {
            enqueue(queue, node->right);
        }
    }
}

int main() {
    int arr[] = {1, 2, 3, 4, 5, 6, 7};
    int size = sizeof(arr) / sizeof(arr[0]);
    TreeNode *root = createTree(arr, size, 0);
    printf("Level order traversal of the created binary tree is: ");
    levelOrderTraversal(root);
    return 0;
}