1、根据前序遍历序列和中序遍历序列,构造二叉树(或求后序遍历序列);
public Node buildTree(int[] preOrder,int[] inOrder){
Node root=buildTree(preOrder,0,preOrder.length-1,inOrder,0,inOrder.length-1);
return root;
}
private Node buildTree(int[] preOrder,int pstart,int pend,int[] inOrder,int istart,int iend){
if