题目描述:
输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
限制:
0 <= 节点个数 <= 5000
作者:Krahets
链接:https://leetcode-cn.com/leetbook/read/illustration-of-algorithm/99lxci/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
解答:
/**
* 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(NULL == preorder || 0 == preorderSize || NULL == inorder || 0 == inorderSize) return NULL;
struct TreeNode *root =(struct TreeNode*)malloc(sizeof(struct TreeNode));
root->val = preorder[0];
int i = 0;
for(i = 0;i < inorderSize;i++){
if(inorder[i] == preorder[0]){
break;
}
}
root->left = buildTree(&preorder[1], i, &inorder[0], i);
root->right = buildTree(&preorder[i + 1], preorderSize - i - 1,&inorder[i + 1], preorderSize - i -1);
return root;
}
运行结果: