leetcode之construct-binary-tree-from-inorder-and-postorder-traversal(给定中序遍历和后序遍历,还原二叉树)
题目
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
题意
给定了inorder这个二叉树的中序遍历和postorder的这个后序遍历输出,要求返回原来的二叉树。
解题思路
这题很好解,需要利用到二叉树的中序遍历和后序遍历的定义,其中中序遍历是左子树->根节点->右子树,而后序遍历则是左子树->右子树->根节点;
利用这两点:
1、先直接取postorder的最后一个元素出来,它是根节点;
2、寻找这个根节点在inorder中对应的index,然后左边是root->left,右边是root->right;
3、递归对左子树和右子树分别再次调用1和2;
4、得到并返回root;
C++实现代码
/**
* Definition for binary tree
* 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) {
vector<int>::size_type lenIn = inorder.size();
vector<int>::size_type lenPost = postorder.size();
return buildTree_x(inorder,0,lenIn-1,postorder,0,lenPost-1);
}
TreeNode* buildTree_x(vector<int> &inorder,int inB,int inE,vector<int> &postorder,int poB,int poE){
if(inB>inE||poB>poE)
return nullptr;
TreeNode* root = new TreeNode(postorder[poE]); //后序遍历,最后一个确认根节点
//中序遍历,确认左右子树,然后递归
vector<int>::iterator iter = find(inorder.begin()+inB,inorder.begin()+inE,postorder[poE]);
int index = iter -inorder.begin();
root->left = buildTree_x(inorder,inB,index-1,postorder,poB,poB+index-1-inB);
root->right = buildTree_x(inorder,index+1,inE,postorder,poB+index-inB,poE-1);
return root;;
}
};