leetcode--ConstructBinaryTreefromInorderandPostorderTraversal
2015-06-15 20:19
513 查看
思路:后序遍历子节点一定在根节点的左边,通过从右往左的遍历可以从根节点到子节点生成二叉树。中序遍历左子节点在根节点的左边,右子节点在根节点的右边。在生成二叉树的时候可以通过中序遍历判断当前节点在二叉树中的位置。
import java.util.HashMap;
/**
* Created by marsares on 15/6/15.
*/
public class ConstructBinaryTreefromInorderandPostorderTraversal {
HashMap<Integer,Integer>hm=new HashMap<Integer,Integer>();
public TreeNode buildTree(int[] inorder, int[] postorder) {
if(postorder.length==0)return null;
if(postorder.length==1)return new TreeNode(postorder[0]);
for(int i=0;i<inorder.length;i++){
hm.put(inorder[i],i);
}
TreeNode root=new TreeNode(postorder[postorder.length-1]);
for(int i=postorder.length-2;i>=0;i--){
root=traversal(postorder[i],root);
}
return root;
}
public TreeNode traversal(int val,TreeNode root){
if(root==null)return new TreeNode(val);
else if(hm.get(val)>hm.get(root.val))root.right=traversal(val,root.right);
else root.left=traversal(val,root.left);
return root;
}
public static void main(String[]args){
ConstructBinaryTreefromInorderandPostorderTraversal cbt=new ConstructBinaryTreefromInorderandPostorderTraversal();
BinaryTreeSerialize bts=new BinaryTreeSerialize();
int[]inorder={4,2,5,1,6,3};
int[]postorder={4,5,2,6,3,1};
TreeNode root=cbt.buildTree(inorder,postorder);
System.out.println(bts.Serialize(root));
}
}
import java.util.HashMap;
/**
* Created by marsares on 15/6/15.
*/
public class ConstructBinaryTreefromInorderandPostorderTraversal {
HashMap<Integer,Integer>hm=new HashMap<Integer,Integer>();
public TreeNode buildTree(int[] inorder, int[] postorder) {
if(postorder.length==0)return null;
if(postorder.length==1)return new TreeNode(postorder[0]);
for(int i=0;i<inorder.length;i++){
hm.put(inorder[i],i);
}
TreeNode root=new TreeNode(postorder[postorder.length-1]);
for(int i=postorder.length-2;i>=0;i--){
root=traversal(postorder[i],root);
}
return root;
}
public TreeNode traversal(int val,TreeNode root){
if(root==null)return new TreeNode(val);
else if(hm.get(val)>hm.get(root.val))root.right=traversal(val,root.right);
else root.left=traversal(val,root.left);
return root;
}
public static void main(String[]args){
ConstructBinaryTreefromInorderandPostorderTraversal cbt=new ConstructBinaryTreefromInorderandPostorderTraversal();
BinaryTreeSerialize bts=new BinaryTreeSerialize();
int[]inorder={4,2,5,1,6,3};
int[]postorder={4,5,2,6,3,1};
TreeNode root=cbt.buildTree(inorder,postorder);
System.out.println(bts.Serialize(root));
}
}
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解
- LeetCode [Day 6] ZigZag Conversion 题解
- LeetCode 2: Add Two Numbers (JAVA)
- LeetCode 1: Two Sum (JAVA)