最近在学习数据结构这本书,遇到这个题目,就开始学习,网上看了很多代码都是用C写的,本人是搞java,于是乎就咋理解了c语言基础上,用java语言实现,效率不一定高但是结果实现了,并测试正确。
前序遍历:ABDECF
中序遍历:DBEAFC
输出结果:DEBFCA
附上源码如下:
/*
* author by xzb
* 2013.8.19
*/
package learning;
public class CreateTree
{
private String data;
private CreateTree leftChild;
private CreateTree rightChild;
public CreateTree(String data, CreateTree leftChild, CreateTree rightChild) {
this.data = data;
this.leftChild = leftChild;
this.rightChild = rightChild;
}
public CreateTree() {
}
//根据前序和中序遍历递归创建树
public CreateTree root(String prerange, String midrange)
{
if(prerange==null||midrange==null)
{
return null;
}
//中序左子树字符串
String left = null;
//中序右子树字符串
String right = null;
//前序左子树字符串
String leftpre = null;
//前序右子树字符串
String rightpre = null;
//左字数的长度
int len = 0;
CreateTree newnode = new CreateTree();
//从先序中获取根节点在中序排序中的位置
int index = midrange.indexOf(prerange.substring(0,1));
//获取中序排序的左子树
if(index>0)
{
left = midrange.substring(0,index);
len = left.length();
}
//获取中序排序右子树
if(index<midrange.length()-1)
{
right = midrange.substring(index+1);
}
//获取前序排列的左子树
leftpre = prerange.substring(1,len+1);
//获取前序排列的右子树
rightpre = prerange.substring(len+1);
newnode.data = (String)prerange.substring(0,1);
newnode.leftChild = root(leftpre, left);
newnode.rightChild = root(rightpre, right);
return newnode;
}
//后续遍历
public void last(CreateTree node)
{
if(node == null)
{
return;
}
last(node.leftChild);
last(node.rightChild);
System.out.print(node.data);
}
public static void main(String[] args)
{
// 前序遍历
String pre ="ABDECF";
// 中序遍历
String mid ="DBEAFC";
CreateTree node = new CreateTree();
CreateTree root = node.root(pre, mid);
System.out.println("后序遍历结果:");
node.last(root);
}
}