6.16 从中序与后序遍历序列构造二叉树

package com.tree.java;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class seven {
	 public TreeNode buildTree(int[] inorder, int[] postorder) {
		 return buildTree1(inorder, 0, inorder.length, postorder, 0, postorder.length);
	 }

	private TreeNode buildTree1(int[] inorder, int inLeft, int inRight, int[] postorder, int postLeft, int postRight) {
		if(inRight - inLeft < 1) {//没有元素了
			return null;
		}
		if(inRight - inLeft == 1) {//只有一个元素了
			return new TreeNode(inorder[inLeft]);
		}
		// 后序数组postorder里最后一个即为根结点
		int rootVal = postorder[postRight - 1];
		TreeNode root = new TreeNode(rootVal);
		int rootIndex = 0;
		// 根据根结点的值找到该值在中序数组inorder里的索引位置rootIndex
		for(int i = inLeft; i < inRight; i++) {
			if(inorder[i] == rootVal) {
				rootIndex = i;
				break;
			}
		}
		// 根据rootIndex划分左右子树---可以看题解思路中的图来理解这里
		root.left = buildTree1(inorder, inLeft, rootIndex, postorder, postLeft, postLeft + (rootIndex - inLeft));
        root.right = buildTree1(inorder, rootIndex + 1, inRight, postorder, postLeft + (rootIndex - inLeft), postRight - 1);
		
		return root;
	}
	
}

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;
	}
}

package com.tree.java;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class seven {
	public TreeNode buildTree(int[] preorder, int[] inorder) {
		return helper(preorder, 0, preorder.length - 1, inorder, 0, inorder.length - 1);
    }

	private TreeNode helper(int[] preorder, int preLeft, int preRight, int[] inorder, int inLeft, int inRight) {
		//递归终止条件
		if(inLeft > inRight || preLeft > preRight) {
			return null;
		}
		// val 为前序遍历第一个的值，也即是根节点的值
        // idx 为根据根节点的值来找中序遍历的下标
		int idx = inLeft, val = preorder[preLeft];
		TreeNode root = new TreeNode(val);
		for(int i = inLeft; i <= inRight; i++) {
			if(inorder[i] == val) {
				idx = i;
				break;
			}
		}
		
		// 根据 idx 来递归找左右子树
		root.left = helper(preorder, preLeft + 1, preLeft + (idx-inLeft), inorder, inLeft, idx-1);
		root.right = helper(preorder, preLeft+(idx - inLeft)+1, preRight, inorder, idx + 1 , inRight);
		
		return root;
	}
}

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;
	}
}