leetcode_26_二叉树的构建及遍历

最新推荐文章于 2024-09-27 15:30:00 发布

weixin_52872520

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量107

点赞数

分类专栏： leetcode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_52872520/article/details/131117011

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>
struct TreeNode
{
    struct TreeNode* left;
    struct TreeNode* right;
    char val;
};

struct TreeNode* CreatTree(char* a, int* pi)
{
    if(a[*pi] == '#')
    {
        (*pi)++;
        return NULL;
    }

    struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));

    root->val = a[(*pi)++];
    root->left = CreatTree(a,pi);
    root->right = CreatTree(a,pi);     

    return root;
}

void InOrder(struct TreeNode* root)
{
    if(root == NULL)
        return;
    
    InOrder(root->left);
    printf("%c ",root->val);
    InOrder(root->right);
}
int main() {
    char a[100];
    scanf("%s",a);
    int i = 0;
    struct TreeNode* root = CreatTree(a, &i);
    InOrder(root);
    return 0;
}