12信管实验报告(树与二叉树的基本操作)

+=p.data.toString(); preOrder(p.left); preOrder(p.right); } returnprestr;?}?@Override?publicStringinOrder(){//中根遍历二叉树//TODOAuto-generatedmethodstub?System.out.print("中根次序遍历二叉树:");?inOrder(root);?Stringinstr="";?/*System.out.println();*/returninstr;?}?publicStringinOrder(BinaryNode<T>p){//中根次序遍历以p结点为根结点的子二叉树,递归方法 Stringinstr=""; if(p!=null)//若二叉树不空{ /*inOrder(p.left); System.out.print(p.data.toString()+""); inOrder(p.right);*/ inOrder(p.left); instr+=p.data.toString(); inOrder(p.right); } returninstr;?}?@Override?publicvoidpostOrder(){//后根次序遍历二叉树//TODOAuto-generatedmethodstub System.out.print("后根次序遍历二叉树:"); postOrder(root); System.out.println();?}publicvoidpostOrder(BinaryNode<T>p,BinaryNode<T>q,BinaryTree<T>bitree2){//?if(p!=null&&q!=null)//如果二叉树不为空?{ postOrder(p.left); postOrder(p.right);