根据前序和中序遍历还原二叉树

Leetcode----105

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        return dfs(preorder,inorder,null);
    }
    int preindex = 0 ;
    int inindex = 0 ;
    public TreeNode dfs(int[] preorder,int[] inorder,TreeNode node){
        if(preindex == preorder.length || (node != null && inorder[inindex] == node.val)){
            return null;
        }
        TreeNode root = new TreeNode(preorder[preindex++]);
        root.left = dfs(preorder,inorder,root);
        inindex++ ;
        root.right = dfs(preorder,inorder,node);
        return root ;
    }
}