实验五二叉树.doc
文本预览下载声明
实验五 二叉树
实验目的：
1、掌握二叉树的创建算法、掌握二叉树的遍历算法
2、掌握哈夫曼树的构造和应用利用哈夫曼方法及其编/译码技术实现对传输信息编码/译码系统。package Q1;
public class BinaryNodeT {
public T data;
public BinaryNodeT left,right;
public BinaryNode(T data,BinaryNodeT left,BinaryNodeT right){
this.data=data;
this.left=left;
this.right=right;
}
public BinaryNode(T data){
this(data,null,null);
}
public BinaryNode(){
this(null,null,null);
}
}
package Q1;
public class BinaryTreeT{
public NodeString head_pre;
public NodeString head_in;
public BinaryNodeT root;
public BinaryTree(){
this.root=null;
}
public boolean isEmpty(){
return this.root==null;
}
private BinaryTreeString init_make(){
BinaryTreeString bitree=new BinaryTreeString();
BinaryNodeString child_f,child_d,child_b,child_c;
child_d=new BinaryNodeString(D,null,new BinaryNodeString(G));
child_b=new BinaryNodeString(B,child_d,null);
child_f=new BinaryNodeString(F,new BinaryNodeString(H),null);
child_c=new BinaryNodeString(C,new BinaryNodeString(E),child_f);
bitree.root=new BinaryNodeString(A,child_b,child_c);
return bitree;
}
private void leaf(BinaryNodeString p){
if(p!=null){
if(p.left==null p.right==null){
System.out.print(p.data+ );
}
leaf(p.left);
leaf(p.right);
}
}
private int leaf_count(BinaryNodeString p){
if(p==null)
return 0;
if(p.left==null p.right==null)
return 1;
else return leaf_count(p.left)+leaf_count(p.right);
}
private void exchange(BinaryNodeString p){
BinaryNode temp = new BinaryNode();
if(p!=null){
temp=p.left;
p.left=p.right;
p.right=temp;
exchange(p.left);
exchange(p.right);
}
}
public BinaryTree(T[] prelist,T[] inlist){
this.root=preOrder_inOrder_make(prelist,inlist,0,0,prelist.length);
}
private BinaryNodeT preOrder_inOrder_make(T[] preList,T[] inList,int preStart,int inStart,int n){
if(n=0)
return null;
T elem=preList[preStart];
BinaryNodeT p=new BinaryNodeT(elem);
int i=0;
while(in !elem.equals(inList[inStart+i]))
i++;
p.lef
显示全部