- ArrayList
- It is in Jdk since 1.2
- Not Syncronised
- If you don't need to syncronise any code. Just simply use this.
- Vector
- It is in Jdk since 1.0
- Syncronised
- Thead Safe - It means it's ok to use it from different threads without we having to syncronise the code
- If you need to syncronise any code. Just simply use this. But it makes code slow
Vector and Arraylist's methods are almost same. So I don't upload any Vector's examples.
-
- time complexity O(1)
Because it don't depends how many items in the list. As long you inserting/removing at the front of the list. - Only have a refference to the head of the list
- time complexity O(1)
-
Doubly Linked Lists - Ref: One, Two
- time complexity O(1)
Because we've a pointer, or a refference, to the tail of the list. - Each item in the list has Next and Previous Field
- This list has a HEAD and a TAIL
- time complexity O(1)
-
- Actually Liked List is one kind of Doubly Linked Lists.
- We should use Linked Lists if we want to insert/delete something from the head or tail. Cz, if you try to do something from the middle, then we'll lose the advantages of using Linked Lists.
- Oracle Documentation
-
- A circular linked list is a variation of a linked list in which the last node points to the first node, completing a full circle of nodes. In other words, this variation of the linked list doesn't have a null element at the end.