# leetcode Construct Binary Tree from Inorder and Postorder Traversal

293人阅读 评论(0)

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
if(inorder==null||inorder.length==0)
{
return null;
}

TreeNode root=new TreeNode(postorder[postorder.length-1]);
build(root, inorder, 0, inorder.length-1, postorder, 0, postorder.length-1);
return root;
}

public void build(TreeNode root,int[] inorder, int ins,int ine,int[] postorder,int pos,int poe)
{
int parentIndexInMiddle=ins;

while(inorder[parentIndexInMiddle]!=root.val)
{
parentIndexInMiddle++;
}

int leftCount=parentIndexInMiddle-ins;

if(leftCount>0)
{
int leftRootIndexInPost=pos+leftCount-1;
root.left=new TreeNode(postorder[leftRootIndexInPost]);
build(root.left, inorder, ins, parentIndexInMiddle-1, postorder, pos, leftRootIndexInPost);
}

int rightCount=ine-parentIndexInMiddle;
if(rightCount>0)
{
int rightRootIndexInpost=poe-1;
root.right=new TreeNode(postorder[rightRootIndexInpost]);
build(root.right, inorder, parentIndexInMiddle+1, ine, postorder, poe-rightCount, poe-1);
}
}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：74131次
• 积分：3815
• 等级：
• 排名：第8679名
• 原创：319篇
• 转载：26篇
• 译文：0篇
• 评论：3条
阅读排行
评论排行
最新评论