数据结构实验三遍历二叉树

1、遍历二叉树。

请输入一棵二叉树的扩展的前序序列，经过处理后生成一棵二叉树，然后对于该二叉树输出中序和后序遍历序列。

2、按层次遍历二叉树。

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

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

// 创建二叉树
TreeNode* createTree(char* preorder, int* index) {
    char val = preorder[(*index)++];
    if (val == '#') {
        return NULL;
    }
    TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));
    newNode->data = val;
    newNode->left = createTree(preorder, index);
    newNode->right = createTree(preorder, index);
    return newNode;
}

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

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

// 层次遍历二叉树
void levelOrderTraversal(TreeNode* root) {
    if (root == NULL) {
        return;
    }
    TreeNode* queue[100];
    int front = 0, rear = 0;
    queue[rear++] = root;
    while (front < rear) {
        TreeNode* current = queue[front++];
        printf("%c ", current->data);
        if (current->left != NULL) {
            queue[rear++] = current->left;
        }
        if (current->right != NULL) {
            queue[rear++] = current->right;
        }
    }
}

int main() {
    char preorder[100] ;
    int index = 0;
    TreeNode* root = (TreeNode*)malloc(sizeof(TreeNode));

    scanf("%s", preorder);
    root = createTree(preorder, &index);
    printf("中序遍历序列：");
    inorderTraversal(root);
    printf("\n");

    printf("后序遍历序列：");
    postorderTraversal(root);
    printf("\n");

    printf("层次遍历序列：");
    levelOrderTraversal(root);
    printf("\n");

    return 0;
}