二叉链表实现二叉树c语言

以下是使用C语言实现二叉链表的代码示例：

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

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

// 创建二叉树
TreeNode* createBinaryTree() {
    int value;
    scanf("%d", &value);
    
    if (value == -1) {
        return NULL;
    }
    
    TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));
    newNode->data = value;
    
    printf("Enter left child of %d: ", value);
    newNode->left = createBinaryTree();
    
    printf("Enter right child of %d: ", value);
    newNode->right = createBinaryTree();
    
    return newNode;
}

// 先序遍历二叉树
void preOrderTraversal(TreeNode* root) {
    if (root == NULL) {
        return;
    }
    
    printf("%d ", root->data);
    preOrderTraversal(root->left);
    preOrderTraversal(root->right);
}

int main() {
    TreeNode* root = NULL;
    
    printf("Enter root value: ");
    root = createBinaryTree();
    
    printf("Preorder traversal of binary tree: ");
    preOrderTraversal(root);
    
    return 0;
}