Leetcode 106: 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.

 

 

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode BuildTree(int[] inorder, int[] postorder) {
         if (postorder.Length == 0) return null;
        
        return DFS(postorder, 0, postorder.Length - 1, inorder, 0, inorder.Length - 1);
    }
    
    private TreeNode DFS(int[] postorder, int pStart, int pEnd, int[] inorder, int iStart, int iEnd)
    {
        if (pStart > pEnd) return null;
        if (pStart == pEnd) return new TreeNode(postorder[pStart]);
        
        var root = new TreeNode(postorder[pEnd]);
        
        int i = iStart;
        for (; i <= iEnd; i++)
        {
            if (inorder[i] == postorder[pEnd]) break;
        }
        
        root.left = DFS(postorder, pStart, pStart + i - iStart - 1, inorder, iStart, i - 1);
        root.right = DFS(postorder, pStart + i - iStart, pEnd - 1, inorder, i + 1, iEnd);
        
        return root;
    }
}