根据二叉树的前序和中序序列,重建二叉树
思路:根据二叉树前序遍历的特点,前序遍历的根节点在第一个位置。中序遍历根节点在中间的位置,根节点的左边是左子树,右边是右子树节点。前序遍历的第一个节点为根节点,在中序系列中搜索根节点的位置,确定左子树的节点个数以及内容。把前根和中根序列分为两部分,进行递归操作,分别建立左右子树。
![这里写图片描述](https://img-blog.csdn.net/20150812184821788?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
代码:
public static class BinaryTreeNode {
public int value;
public BinaryTreeNode leftNode;
public BinaryTreeNode rightNode;
public BinaryTreeNode(int value){
this.value = value ;
this.leftNode = null;
this.rightNode = null;
}
}
static class InvalidPutException extends Exception {
private static final long serialVersionUID = 1L;
}
public static void main(String[] args) throws Exception{
int[] preOrder={1,2,4,7,3,5,6,8};
int[] inOrder={4,7,2,1,5,3,8,6};
printPreOrder(Construct(preOrder, inOrder, preOrder.length));
}
public static void printPreOrder(BinaryTreeNode root) {
if (root == null) {
return;
} else {
System.out.print(root.value + " ");
}
if (root.leftNode != null) {
printPreOrder(root.leftNode);
}
if (root.rightNode != null) {
printPreOrder(root.rightNode);
}
}
/**
*
* @param preOrder 前序遍历数组
* @param inOrder 中序遍历数组
* @param length 数组长度
* @return 根结点
*/
public static BinaryTreeNode Construct(int[] preOrder, int[] inOrder, int length){
if (preOrder == null || inOrder == null || length <= 0) {
return null;
}
try {
return ConstructCore(preOrder, 0, preOrder.length - 1, inOrder, 0,inOrder.length - 1);
} catch (InvalidPutException e) {
e.printStackTrace();
return null;
}
}
/**
*
* @param PreOrder
* 前序遍历序列
* @param startPreIndex
* 前序序列开始位置
* @param endPreIndex
* 前序序列结束位置
* @param InOrder
* 中序遍历序列
* @param startInIndex
* 中序序列开始位置
* @param endInIndex
* 中序序列结束位置
* @return 根结点
* @throws InvalidPutException
*/
public static BinaryTreeNode ConstructCore(int[] preOrder, int startPreIndex, int endPreIndex,
int[] inOrder, int startInIndex, int endInIndex) throws InvalidPutException {
int rootValue = preOrder[startPreIndex];
System.out.println("rootValue = " + rootValue);
BinaryTreeNode root = new BinaryTreeNode(rootValue);
if (startPreIndex == endPreIndex) {
if (startInIndex == endInIndex
&& preOrder[startPreIndex] == inOrder[startInIndex]) {
System.out.println("only one element");
return root;
} else {
throw new InvalidPutException();
}
}
int rootInIndex = startInIndex;
while (rootInIndex <= endInIndex && inOrder[rootInIndex] != rootValue) {
++rootInIndex;
}
if (rootInIndex == endInIndex && inOrder[rootInIndex] != rootValue) {
throw new InvalidPutException();
}
int leftLength = rootInIndex - startInIndex;
int leftPreOrderEndIndex = startPreIndex + leftLength;
if (leftLength > 0) {
root.leftNode = ConstructCore(preOrder, startPreIndex + 1,
leftPreOrderEndIndex, inOrder, startInIndex,
rootInIndex - 1);
}
if (leftLength < endPreIndex - startPreIndex) {
root.rightNode = ConstructCore(preOrder, leftPreOrderEndIndex + 1,
endPreIndex, inOrder, rootInIndex + 1, endInIndex);
}
return root;
}