Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Possible Duplicate:
When to use LinkedList<> over ArrayList<>?
When to use a linked list over an array/array list?
When should I use arrayList and when should I go for LinkedList?
When should I use TreeSet, LinkedHashSet and HashSet?
Arraylist maintain indices like arrays. So if want more frequent get operations than put then arraylist is best to go.
LinkedList maintain pointers to elements. you can’t to a specific index like in arraylist. But the advantage here in linkedlist is that they don’t need to shift back and forth like in arraylist to maintain continues indices. So get operations in linkedlist are costly as you would have to go through pointers to reach your elements. But put operations are good as compared to arraylist. you just need to connect to pointers and that’s it.
the difference is only in ordering. treeset elements need to maintain a specific orders defined by your member objects.