[leetcode] 106. Construct Binary Tree from Inorder and Postorder Traversal

Description

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

For example, given

inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]

Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

分析

题目的意思是：用后序遍历和中序遍历，重构二叉树。

• 需要用到递归，后序遍历是左右中，中序遍历左中右。后序遍历可以得出根结点，中序遍历可以根据根结点位置，确定左右分支，然后继续递归解析。
• 这里需要注意这种题目的解法非常固定，所以有意识的记下来是很有必要的。

C++实现

/**
 * 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 build(inorder,postorder,0,inorder.size()-1,0,postorder.size()-1);
    }
    
    TreeNode* build(vector<int>& inorder, vector<int>& postorder,int in_start,int in_end,int po_start,int po_end){
        if(in_start>in_end){
            return NULL;
        }
        TreeNode* root=new TreeNode(postorder[po_end]);
        int i=0;
        for(i=in_start;i<in_end;i++){
            if(inorder[i]==postorder[po_end]){
                break;
            }
        }
        int len=i-in_start;
        root->left=build(inorder,postorder,in_start,i-1,po_start,po_start+len-1);
        root->right=build(inorder,postorder,i+1,in_end,po_start+len,po_end-1);
        return root;
    }
};

Python实现

C++实现版本传的参数过多，我这里直接对inorder和postorder进行了截取，看上去好一点了。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def create_tree(self, inorder, postorder):
        # inorder left midddle right
        # posorder left right middle
        if len(inorder)==0:
            return None
        root = TreeNode(postorder[-1])
        in_idx = inorder.index(root.val)
        # remove middle
        in_left = inorder[:in_idx]
        in_right = inorder[in_idx+1:]

        pos_left = postorder[:in_idx]
        pos_right = postorder[in_idx:-1]

        root.left = self.create_tree(in_left, pos_left)
        root.right = self.create_tree(in_right, pos_right)
        return root


    def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:
        return self.create_tree(inorder, postorder)

参考文献

[编程题]construct-binary-tree-from-inorder-and-postorder-traversal