Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
原题链接:https://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
题目:给定一棵树的中序和后序遍历,构建一颗二叉树。
分析:与前一题类似,后序遍历的最后一个节点为根节点,以此节点在中序遍历中可作为左右子树的分界,递归的遍历即可找到节点间的依存关系。
public TreeNode buildTree(int[] inorder,int[] postorder) {
return buildTree(inorder,0,inorder.length-1,postorder,0,postorder.length-1);
}
public TreeNode buildTree(int[] inorder,int startin,int endin,int[] postorder,int startpost,int endpost){
if(startpost>endpost || startin>endin)
return null;
int pivot = postorder[endpost];
int index = 0;
for(;index<=endin;index++){
if(inorder[index]==pivot)
break;
}
TreeNode root = new TreeNode(pivot);
root.left = buildTree(inorder,startin,index-1,postorder,startpost,startpost+index-(startin+1));
root.right = buildTree(inorder,index+1,endin,postorder,startpost+index-startin,endpost-1);
return root;
}
// Definition for binary tree
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}