treeset 是有序吗_TreeSet如何实现有序?

package set.test;

import java.util.TreeSet;

/**

* 实现TreeSet存储和取出的顺序一致

* */

public class TreeSetTest {

public static void main(String[] args) {

//首先我们知道TreeSet底层是二叉树算法

TreeSet treeSet = new TreeSet<>();

treeSet.add(new Person("小A", 17));

treeSet.add(new Person("小B", 19));

treeSet.add(new Person("小C", 21));

treeSet.add(new Person("小C", 21));

//增强for循环

for (Person person : treeSet) {

System.out.println(person.getName()+"..."+person.getAge());

}

}

}

class Person implements Comparable{

private String name;

private int age;

public Person(String name, int age) {

this.name = name;

this.age = age;

}

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public int getAge() {

return age;

}

public void setAge(int age) {

this.age = age;

}

@Override

public int compareTo(Person o) {

//return compareToAge(o);

System.out.println("进入compareTo方法");

return compareToAge(o);

}

//按年龄从大到小排序

private int compareToAge(Person o) {

//判断是不是本身

if(o==this) {

return 0;

}

int result = o.getAge()-this.getAge();

if(result>0) {

return 1;

}else if(result<0) {

return -1;

}

return 0;

}

//存储和取出顺序一致

private int compareToNormal() {

return 1;

}

}