二叉树结点类JAVA程序.doc

二叉树结点类,二叉树类及测试程如下:public class BinNode /二叉树结点类 public int value; public BinNode leftchild; public BinNode rightchild; BinNode()leftchild=null; rightchild=null; BinNode(int va,BinNode lc,BinNode rc) value=va; leftchild=lc; rightchild=rc; public void setValue(int a)value=a; public int getValue()return value; public void setLeftchild(BinNode box1)leftchild=box1; public BinNode getLeftchild()return leftchild; public void setRightchild(BinNode box2)rightchild=box2; public BinNode getRightchild()return rightchild;public class BinTree /二叉树类 public BinNode root; public BinTree(int a,BinTree l,BinTree r) /构造函数 BinNode left; BinNode right; if (l!=null) left=l.root; else left=null; if (r!=null) right=r.root; else right=null; root=new BinNode(a,left,right);public void print(int nowdata) System.out.print(nowdata+ ); public void froscan(BinNode root) if(root!=null) print(root.getValue(); foscan(root.getLeftchild(); froscan(root.getRightchild(); public void midscan(BinNode root)if(root!=null) midscan(root.getLeftchild(); print(root.getValue(); midscan(root.getRightchild();public void bacscan(BinNode root)if(root!=null)bacscan(root.getLeftchild(); bacscan(root.getRightchild(); print(root.getValue();public void froplay() /前序遍历 froscan(root); public void midplay() /中序遍历 midscan(root); public void bacplay() /后序遍历bacscan(root); public class Test /测试程序public static void main(String args) throws ExceptionBinTree a,b,c,d,e,f,g; g=new BinTree(70,null,null); e=new BinTree(60,null,null); f=new BinTree(50,null,null); d=new BinTree(40,null,g); c=new BinTree(30,e,f); b=new BinTree(20,d,null); a=new BinTree(10,b,c); System.out.println(此树的前序遍历结果:); a.froplay(); System