TreeSet和compareTo（）方法。(TreeSet and compareTo() method. Single sort or multiple sorts)

 我目前正在开发一个程序，我使用TreeSet存储唯一键。 我正在使用TreeSet，因为我希望它们排序。 
 
 截至目前，我一直在制作一个TreeSet对象，并在需要时一次一个地添加字符串。 
 
TreeSet set = new TreeSet();
set.add("How");
set.add("Are");
set.add("You");
 
 据推测，TreeSet使用Compareable interface的compareTo方法对字符串进行排序。 这意味着每次向其添加String时，TreeSet都必须进行排序。 
 
 现在我的问题是：在将all strings添加到HashSet之后创建HashSet然后创建TreeSet会更有效吗？ 
 
TreeSet<String> treeSet = new TreeSet<String>(set);
 
 我的想法是关于TreeSet是否只需要以这种方式进行单一排序。 
 
 提前致谢 

Im currently working on a program, where im using a TreeSet to store unique keys. I'm using a TreeSet, because I want them sorted.
 
As of now, I have been making a TreeSet object, and added the strings one-at-a-time, when needed.
 
TreeSet set = new TreeSet();
set.add("How");
set.add("Are");
set.add("You");
 
Supposedly, the TreeSet uses the compareTo method in the Compareable interface, to sort the strings. That would mean that the TreeSet would have to do a sort each time I add a String to it.
 
Now my question is this: Would it be more efficient to create a HashSet and then create the TreeSet after all strings are added to the HashSet? 
 
TreeSet<String> treeSet = new TreeSet<String>(set);
 
My thoughts are going about whether the TreeSet would only need to do a single sort that way.
 
Thanks in advance

原文：https://stackoverflow.com/questions/18452728