fork download

copy

package com.iw.tree;
 
import java.util.HashMap;
import java.util.Map;
 
public class TreeFromInorderPreorder {
    public static int preIndex = 0;
	public static void main(String[] args) {		
		int pre[] = {7,10,4,3,1,2,8,11};
		int in[] = {4,10,3,1,7,11,8,2};
		int post[] = {4,1,3,10,11,8,2,7};
		Map indexMap = indexFromVal(in);
 
		//TreeNode root = inorderPreorder(in,pre,0,in.length - 1 ,indexMap);
 
		//TreeNode root = buildInorderPreorder(pre,pre.length-1,0,indexMap,0);
		TreeNode root = buildInorderPostorder(post,post.length,0,indexMap,8);
		postorder(root);
 
	}
 
	public static TreeNode inorderPreorder(int in[],int pre[], int inStart, int inEnd, Map<Integer,Integer> indexMap) {
 
		if(inStart > inEnd)
			return null;		
		TreeNode root = new TreeNode(pre[preIndex++]);
		int index = indexMap.get(root.getValue());
		root.setLeft(inorderPreorder(in, pre, inStart, index -1 , indexMap));
		root.setRight(inorderPreorder(in, pre, index+1, inEnd , indexMap));
 
		return root;
 
	}
 
	public static TreeNode buildInorderPreorder( int pre[], int n, int offset,Map<Integer,Integer> indexMap,int index) {	  
	  if (n <= 0) return null;
	  int rootVal = pre[index];
	  int i = (indexMap.get(rootVal) - offset);
	  TreeNode root = new TreeNode(rootVal);
	  root.setLeft(buildInorderPreorder( pre, i, offset,indexMap,index+1));
	  root.setRight(buildInorderPreorder(pre, n-i-1, offset+i+1,indexMap,index+i+1));
	  return root;
	}
 
 
 
	public static TreeNode buildInorderPostorder( int post[], int n, int offset,Map<Integer,Integer> indexMap,int size) {	  
		  if (size <= 0) return null;
		  int rootVal = post[n-1];
		  int i = (indexMap.get(rootVal) - offset);
		  TreeNode root = new TreeNode(rootVal);
		  root.setLeft(buildInorderPostorder( post, i, offset,indexMap,i-offset));
		  root.setRight(buildInorderPostorder(post, n-1, offset+i+1,indexMap,n-1-i));
		  return root;
		}
 
 
 
	public static void inorder(TreeNode root) {
		if(root != null) {
			inorder(root.getLeft());
			System.out.print(root.getValue() + ",");
			inorder(root.getRight());
 
		}
 
	}
 
	public static void postorder(TreeNode root) {
		if(root != null) {
			postorder(root.getLeft());
 
			postorder(root.getRight());
			System.out.print(root.getValue() + ",");
		}
 
	}
	public static Map indexFromVal(int in[]) {
		Map indexMap = new HashMap<Integer, Integer>();
		for(int i =0 ; i<in.length; i++) {
			indexMap.put(in[i], i);
		}
		return indexMap;
	}
}
 

Main.java:6: error: class TreeFromInorderPreorder is public, should be declared in a file named TreeFromInorderPreorder.java
public class TreeFromInorderPreorder {
       ^
Main.java:22: error: cannot find symbol
	public static TreeNode inorderPreorder(int in[],int pre[], int inStart, int inEnd, Map<Integer,Integer> indexMap) {
	              ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:35: error: cannot find symbol
	public static TreeNode buildInorderPreorder( int pre[], int n, int offset,Map<Integer,Integer> indexMap,int index) {	  
	              ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:47: error: cannot find symbol
	public static TreeNode buildInorderPostorder( int post[], int n, int offset,Map<Integer,Integer> indexMap,int size) {	  
	              ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:59: error: cannot find symbol
	public static void inorder(TreeNode root) {
	                           ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:69: error: cannot find symbol
	public static void postorder(TreeNode root) {
	                             ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:17: error: cannot find symbol
		TreeNode root = buildInorderPostorder(post,post.length,0,indexMap,8);
		^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:26: error: cannot find symbol
		TreeNode root = new TreeNode(pre[preIndex++]);
		^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:26: error: cannot find symbol
		TreeNode root = new TreeNode(pre[preIndex++]);
		                    ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:39: error: cannot find symbol
	  TreeNode root = new TreeNode(rootVal);
	  ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:39: error: cannot find symbol
	  TreeNode root = new TreeNode(rootVal);
	                      ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:51: error: cannot find symbol
		  TreeNode root = new TreeNode(rootVal);
		  ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Main.java:51: error: cannot find symbol
		  TreeNode root = new TreeNode(rootVal);
		                      ^
  symbol:   class TreeNode
  location: class TreeFromInorderPreorder
Note: Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
13 errors

Standard output is empty