TreeSet中的排序方式有哪些

package exercise1;public class Person implements Comparable{  private int id;  private String name;  public Person(int id, String name) {    super();    this.id = id;    this.name = name;  }  public int getId() {    return id;  }  public void setId(int id) {    this.id = id;  }  public String getName() {    return name;  }  public void setName(String name) {    this.name = name;  }  public String toString() {    return "Person [id=" + id + ", name=" + name + "]";  }  public int hashCode() {    final int prime = 31;    int result = 1;    result = prime * result + id;    result = prime * result + ((name == null) ? 0 : name.hashCode());    return result;  }  public boolean equals(Object obj) {    if (this == obj)      return true;    if (obj == null)      return false;    if (getClass() != obj.getClass())      return false;    Person other = (Person) obj;    if (id != other.id)      return false;    if (name == null) {      if (other.name != null)        return false;    } else if (!name.equals(other.name))      return false;    return true;  }  public int compareTo(Object o) {    if(o instanceof Person){      Person p=(Person)o;      return this.name.compareTo(p.name);    }    return 0;  }  }