Leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium) (cpp)
Tag: Array, Tree, Depth-first Search
Difficulty: Medium
/*
106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
return BT(inorder, 0, inorder.size() - 1, postorder, 0, postorder.size() - 1);
}
TreeNode* BT(vector<int>& inorder, int il, int ir, vector<int>& postorder, int pl, int pr) {
if (il > ir) {
return NULL;
}
int val = postorder[pr];
TreeNode *root = new TreeNode(val);
int i = il;
for (; i < ir; i++) {
if (val == inorder[i]) {
break;
}
}
root -> left = BT(inorder, il, i - 1, postorder, pl, pl - il + i - 1);
root -> right = BT(inorder, i + 1, ir, postorder, pl - il + i, pr - 1);
return root;
}
};