treeset Q. - reverse order

Set<Integer> mySet = new TreeSet<Integer>(myList);
mySet.add(7);
myList = new ArrayList<Integer>(mySet);
myList.add(3,7);
Collections.reverse(myList);

Anyone have a clue how i would go about getting this in reverse order (if the list was integers)
CoolkillAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Ajay-SinghCommented:
CoolkillAuthor Commented:
yeah i found that but i couldnt figure it out.
CoolkillAuthor Commented:
example?
CEHJCommented:
Set<Integer> mySet = new TreeSet<Integer>(Collections.reverseOrder());
mySet.addAll(myList);

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
Mick BarryJava DeveloperCommented:
> Collections.reverse(myList);

that will reverse the order of your list.

which collection did u want to reverse the order of?

Or did you want to sort it?

Collections.sort(myList, Collections.reverseOrder());
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Java

From novice to tech pro — start learning today.