从二叉树的前序和中序得到后续遍历算法

最新推荐文章于 2021-03-19 22:30:22 发布

a343315623

最新推荐文章于 2021-03-19 22:30:22 发布

阅读量354

点赞数

分类专栏：智力题代码

本文链接：https://blog.csdn.net/a343315623/article/details/51427201

版权

智力题代码专栏收录该内容

2 篇文章 0 订阅

订阅专栏

public class ConvertToPost {
private char[] preArr;
private char[] inArr;
private char[] postArr;

public ConvertToPost(char[] preArr, char[] inArr) {
this.preArr = preArr;
this.inArr = inArr;
}

//
public char[] getpostArr() throws ArrayWrongException {
Node Root = toBTree(0, preArr.length - 1, 0, inArr.length - 1);
if (preArr.length != inArr.length)
throw new ArrayWrongException(
"the length of the two array is not equal!");
postArr = new char[preArr.length];
postOrder(Root);
return postArr;
}

private Node toBTree(int preL, int preR, int inL, int inR)
throws ArrayWrongException {
Node root = new Node(preArr[preL]);
int rootIninArr = -1;
int i = -1;
for (i = inL; i <= inR; i++)
if (inArr[i] == root.key) {
rootIninArr = i;
break;
}
if (i == inR + 1)
throw new ArrayWrongException(
"the two array cant convert to a binary tree!");
int leftLen = rootIninArr - inL;
int rightLen = inR - rootIninArr;
if (leftLen != 0)
root.left = toBTree(preL + 1, preL + leftLen, inL,
rootIninArr - 1);
if (rightLen != 0)
root.right = toBTree(preL + leftLen + 1, preR, rootIninArr + 1,
inR);
return root;
}

private void postOrder(Node node) {
if (node != null) {
postOrder(node.left);
postOrder(node.right);
for (int i = 0; i < postArr.length; i++)
if ((int) postArr[i] == 0) {
postArr[i] = node.key;
break;
}
}
}
}