LinkedList

LinkedList is a collection class which extends AbstractList and implements List interface.

  1. LinkedList underlying data structure is doubly Linkedlist.
  2. It doesn’t implements Random access interface so we can’t access the elements randomly.
  3. It is not synchronized. If we want to use LinkedList with multi threading then we need to synchronized explicitly using  Collections.synchronizedList(List l).
  4. Accessing elements with LinkedList is heavy process because if we want to access a element it needs to traverse full list if the element in the last position.
  5. Adding and removing elements is lightweight process in LinkedList, because it just modify the address of a node.
  6. LinkedList requires more memory than ArrayList because each node holds previous element address, data and next element address.
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s