怎么在Java中利用二叉查找树算法实现一个排序功能

public class BinaryNode<T extends Comparable<T>> {  private static int index = 0; // 排序下标  private static int len = 0; // 最大数组长度  private T t; // 根节点  private BinaryNode<T> left; // 左侧叶子节点  private BinaryNode<T> right; // 右侧叶子节点  public BinaryNode(T t) {    len++;    this.t = t;  }    public void insert(T t) {    if (this.t.compareTo(t) > 0) {      if (this.left == null) {        BinaryNode<T> node = new BinaryNode<T>(t);        this.left = node;      } else {        this.left.insert(t);      }    } else {      if (this.right == null) {        BinaryNode<T> node = new BinaryNode<T>(t);        this.right = node;      } else {        this.right.insert(t);      }    }  }    public Comparable<&#63;>[] order() {    Comparable<&#63;>[] os = new Comparable[len];    order(this, os);    return os;  }    private void order(BinaryNode<T> bn, Comparable<&#63;>[] os) {    if (bn.left == null) {      os[index++] = bn.t;    } else {      order(bn.left, os);      os[index++] = bn.t;    }    if (bn.right == null) {      return;    } else {      order(bn.right, os);    }  }}