C语言数据结构：树和图的数据表示与操作

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

int adjMatrix[V][V];

struct AdjListNode {
    int dest;
    struct AdjListNode *next;
};

struct AdjList {
    struct AdjListNode *head;
};

struct Graph {
    int V;
    struct AdjList *array;
};

// 创建二叉查找树
struct TreeNode *createBST(int data) {
    struct TreeNode *root = malloc(sizeof(struct TreeNode));
    root->data = data;
    root->left = root->right = NULL;
    return root;
}

// 在二叉查找树中搜索元素
int searchBST(struct TreeNode *root, int data) {
    if (!root) {
        return 0;
    } else if (root->data == data) {
        return 1;
    } else if (data < root->data) {
        return searchBST(root->left, data);
    } else {
        return searchBST(root->right, data);
    }
}

// 在二叉查找树中插入元素
struct TreeNode *insertBST(struct TreeNode *root, int data) {
    if (!root) {
        return createBST(data);
    } else if (data < root->data) {
        root->left = insertBST(root->left, data);
    } else if (data > root->data) {
        root->right = insertBST(root->right, data);
    }
    return root;
}

// 在二叉查找树中删除元素
struct TreeNode *deleteBST(struct TreeNode *root, int data) {
    if (!root) {
        return NULL;
    } else if (data < root->data) {
        root->left = deleteBST(root->left, data);
    } else if (data > root->data) {
        root->right = deleteBST(root->right, data);
    } else {
        // 如果节点有两个子节点，则找到前驱（左子树中最右节点）或后继（右子树中最左节点）
        if (root->left && root->right) {
            int successor = root->right->data;
            root->data = successor;
            root->right = deleteBST(root->right, successor);
        } else if (root->left) {
            struct TreeNode *temp = root->left;
            free(root);
            return temp;
        } else if (root->right) {
            struct TreeNode *temp = root->right;
            free(root);
            return temp;
        } else {
            free(root);
            return NULL;
        }
    }
    return root;
}