题目:
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
思路:
中序遍历的顺序:左根右,后序遍历的顺序:左右根。因而我们可以找到最后一个结点是根节点,前序遍历中找到此点,左边是左子树,右边是右子树,依次递归可以得到最终的结果。
代码:
/** * Definition for binary tree * 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 || postorder==null || inorder.length==0|| postorder.length==0){ return null; } return constructTree(inorder,0,inorder.length-1,postorder,0,postorder.length-1); } public TreeNode constructTree(int[] inorder,int instart,int inend,int[] postorder,int poststart,int postend){ if(instart>inend || poststart>postend){ return null; } TreeNode root = new TreeNode(postorder[postend]); for(int i=0;i<postorder.length;i++){ if(inorder[i] == postorder[postend]){ root.left = constructTree(inorder,instart,i-1,postorder,poststart,poststart+i-1-instart); root.right = constructTree(inorder,i+1,inend,postorder,poststart+i-instart,postend-1); } } return root; } }
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.