用C语言实现二叉树的创建、先中后序遍历、求树的高度、叶子个数、复制一棵二叉树、判断两棵二叉树是否相等操作

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

// 定义二叉树节点结构
struct TreeNode {
    int data;
    struct TreeNode* left;
    struct TreeNode* right;
};

// 创建新节点
struct TreeNode* createNode(int data) {
    struct TreeNode* newNode = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    if (newNode == NULL) {
        printf("内存分配失败\n");
        exit(EXIT_FAILURE);
    }
    newNode->data = data;
    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
}

// 插入节点
struct TreeNode* insertNode(struct TreeNode* root, int data) {
    if (root == NULL) {
        return createNode(data);
    }

    if (data < root->data) {
        root->left = insertNode(root->left, data);
    } else if (data > root->data) {
        root->right = insertNode(root->right, data);
    }

    return root;
}

// 先序遍历
void preorderTraversal(struct TreeNode* root) {
    if (root != NULL) {
        printf("%d ", root->data);
        preorderTraversal(root->left);
        preorderTraversal(root->right);
    }
}

// 中序遍历
void inorderTraversal(struct TreeNode* root) {
    if (root != NULL) {
        inorderTraversal(root->left);
        printf("%d ", root->data);
        inorderTraversal(root->right);
    }
}

// 后序遍历
void postorderTraversal(struct TreeNode* root) {
    if (root != NULL) {
        postorderTraversal(root->left);
        postorderTraversal(root->right);
        printf("%d ", root->data);
    }
}

// 计算二叉树深度
int calculateDepth(struct TreeNode* root) {
    if (root == NULL) {
        return 0;
    } else {
        int leftDepth = calculateDepth(root->left);
        int rightDepth = calculateDepth(root->right);

        return (leftDepth > rightDepth) ? (leftDepth + 1) : (rightDepth + 1);
    }
}

// 计算叶子节点数
int countLeaves(struct TreeNode* root) {
    if (root == NULL) {
        return 0;
    } else if (root->left == NULL && root->right == NULL) {
        return 1;
    } else {
        return countLeaves(root->left) + countLeaves(root->right);
    }
}

// 复制二叉树
struct TreeNode* copyTree(struct TreeNode* root) {
    if (root == NULL) {
        return NULL;
    }

    struct TreeNode* newRoot = createNode(root->data);
    newRoot->left = copyTree(root->left);
    newRoot->right = copyTree(root->right);

    return newRoot;
}

// 判断两棵二叉树是否相等
int areTreesEqual(struct TreeNode* root1, struct TreeNode* root2) {
    if (root1 == NULL && root2 == NULL) {
        return 1;
    } else if (root1 != NULL && root2 != NULL) {
        return (
            root1->data == root2->data &&
            areTreesEqual(root1->left, root2->left) &&
            areTreesEqual(root1->right, root2->right)
        );
    } else {
        return 0;
    }
}

// 释放二叉树内存
void freeTree(struct TreeNode* root) {
    if (root != NULL) {
        freeTree(root->left);
        freeTree(root->right);
        free(root);
    }
}

int main() {
    struct TreeNode* root = NULL;

    // 插入一些示例数据
    root = insertNode(root, 50);
    insertNode(root, 30);
    insertNode(root, 20);
    insertNode(root, 40);
    insertNode(root, 70);
    insertNode(root, 60);
    insertNode(root, 80);

    // 先序遍历并输出
    printf("先序遍历: ");
    preorderTraversal(root);
    printf("\n");

    // 中序遍历并输出
    printf("中序遍历: ");
    inorderTraversal(root);
    printf("\n");

    // 后序遍历并输出
    printf("后序遍历: ");
    postorderTraversal(root);
    printf("\n");

    // 计算深度并输出
    int depth = calculateDepth(root);
    printf("二叉树的深度是: %d\n", depth);

    // 计算叶子节点数并输出
    int leaves = countLeaves(root);
    printf("二叉树的叶子节点数是: %d\n", leaves);

    // 复制二叉树并输出复制后的先序遍历
    struct TreeNode* copiedTree = copyTree(root);
    printf("复制的树的先序遍历: ");
    preorderTraversal(copiedTree);
    printf("\n");

    // 判断两棵二叉树是否相等
    if (areTreesEqual(root, copiedTree)) {
        printf("原树和复制的树相等\n");
    } else {
        printf("原树和复制的树不相等\n");
    }

    // 释放内存
    freeTree(root);
    freeTree(copiedTree);

    return 0;
}