CheriYu的博客

package myLink;import javax.xml.transform.Templates;public class LianBiao { static Node head=null; /** * 查找单链表的中间节点 * */ public Node getMid(){ Node p=head; Node q=

package shujujiegou;public class BinaryTree { private Node root=null; public BinaryTree(){ root=new Node(1,"A"); } //创建一个二叉树 public void createTree(Node root){ Node n

//时间复杂度:n^2,稳定package shujujiegou;public class InsertSort { static final int SIZE=10; static void insertsort(int a[]){ int i,j,t,h; for(i=1;i<a.length;i++){ t=a[i];