Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
package leetcode;
public class Construct_binary_tree_from_inorder_and_postorder_traversal {
public static void main(String[] args) {
/* int[] a = {1,2,4,5,3,6,7};
int[] b = {4,2,5,1,6,3,7};*/
int[] a = {1,2};
int[] b = {2,1};
System.out.println(buildTree(a, b));
}
public static TreeNode buildTree(int[] inorder, int[] postorder) {
return buildTreeToo(inorder, 0 , inorder.length - 1, postorder , 0 , postorder.length - 1);
}
private static TreeNode buildTreeToo(int[] inorder, int start1, int end1, int[] postorder, int start2, int end2) {
if(end1 < start1 || end2 < start2) { //当右界大于左界时,此时返回空指针
return null;
}
int temp = postorder[end2]; //后序遍历的最后元素即是根节点
TreeNode t = new TreeNode(temp);
int count = 0; //计数变量
for( ; count <= end1 ; count ++) { //这个count可以理解为根节点在中序遍历数组中的元素下标
if( inorder[count] == temp)
break;
}
int len = count - start1; //len表示此时的根节点的左子树的包含元素的个数
t.left = buildTreeToo(inorder, start1, count - 1, postorder, start2, start2 + len -1);
//如果count为start,则表示根节点左边没有元素,inorder右边界的值减一,此时右边界小于左边界则回再下一层返回为空
//同理如果len的值为0,则表示根节点左边没有元素,postorder右边界的值加上len减一,此时右边界小于左边界则回再下一层返回为空
//同理根节点左边元素为1个,或者多个,个人认为,把最基础为0,为1的情况弄明白,也就是最下层的细节弄明白,其他就会自然清楚了,以为多个元素最后也会归到最下层的树
t.right = buildTreeToo(inorder, count + 1, end1 , postorder, start2 + len , end2 -1);
//在inorder数组中,从start1到count-1为左子树部分,从count+1到end1为右子树部分,count为根节点的下标
//在postorder数组中,从start2到 start2 + len -1为左子树部分,从start2 + len 到 end2 -1位右子树部分,end2位根节点下标。
//t.left想清楚之后,t.right对比t.left不要漏元素即可
return t;
}
}