105. Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2024-10-16 10:13:45 发布

mstark

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量125

点赞数

分类专栏： leetcode binaryTree 文章标签： leetcode binary tree

本文链接：https://blog.csdn.net/qq_34662699/article/details/81146347

版权

leetcode binaryTree 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

二叉树的遍历　先序　中序　－－＞确定数的形态

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

struct TreeNode* buildTree(int* preorder, int preorderSize, int* inorder, int inorderSize) {

    if(preorderSize == 0){
        return NULL;
    }

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

    root->val = preorder[0];
    root->left = root->right = NULL;

    int i;
    for(i=0;i<inorderSize;i++){
        if(inorder[i] == preorder[0]) break;
    }
    struct TreeNode* left = buildTree( preorder+1, i,inorder,i);
    //数组的开始位置还有大小　是根据　第一次传入的数组的实例计算的　适用于之后的情况
    struct TreeNode* right = buildTree(preorder+1+i,preorderSize-i-1,inorder+i+1,inorderSize-i-1);
    root->left = left;
    root->right = right;
    return root;
}